{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T22:54:33Z","timestamp":1770072873461,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030967307","type":"print"},{"value":"9783030967314","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_12","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"135-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reverse Shortest Path Problem in\u00a0Weighted Unit-Disk Graphs"],"prefix":"10.1007","author":[{"given":"Haitao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yiming","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"P Agarwal","year":"1999","unstructured":"Agarwal, P., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29, 912\u2013953 (1999)","journal-title":"SIAM J. Comput."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Avraham, R.B., Filtser, O., Kaplan, H., Katz, M.J., Sharir, M.: The discrete and semicontinuous Fr\u00e9chet distance with shortcuts via approximate distance counting and selection. ACM Trans. Algorithms 11(4), 1\u201329 (2015). Article No. 29","DOI":"10.1145\/2700222"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J Bentley","year":"1979","unstructured":"Bentley, J.: Decomposable searching problems. Inf. Process. Lett. 8, 244\u2013251 (1979)","journal-title":"Inf. Process. Lett."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton, D., Toint, P.: On an instance of the inverse shortest paths problem. Math. Program. 53, 45\u201361 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.comgeo.2014.12.003","volume":"48","author":"S Cabello","year":"2015","unstructured":"Cabello, S., Jej\u010di\u010d, M.: Shortest paths in intersection graphs of unit disks. Comput. Geom. Theory Appl. 48(4), 360\u2013367 (2015)","journal-title":"Comput. Geom. Theory Appl."},{"key":"12_CR6","unstructured":"Chan, T., Skrepetos, D.: All-pairs shortest paths in unit-disk graphs in slightly subquadratic time. In: Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC), pp. 24:1\u201324:13 (2016)"},{"key":"12_CR7","unstructured":"Chan, T., Skrepetos, D.: Approximate shortest paths and distance oracles in weighted unit-disk graphs. In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG), pp. 24:1\u201324:13 (2018)"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Guibas, L., Stolfi, J.: Optimal point location in a monotone subdivision. SIAM J. Comput. 15(2), 317\u2013340 (1986)","journal-title":"SIAM J. Comput."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153\u2013174 (1987). https:\/\/doi.org\/10.1007\/BF01840357","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G Frederickson","year":"1984","unstructured":"Frederickson, G., Johnson, D.: Generalized selection and ranking: sorted matrices. SIAM J. Comput. 13(1), 14\u201330 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0196-6774(83)90035-4","volume":"4","author":"G Frederickson","year":"1983","unstructured":"Frederickson, G., Johnson, D.: Finding $$k$$th paths and $$p$$-centers by generating and searching good data structures. J. Algorithms 4(1), 61\u201380 (1983)","journal-title":"J. Algorithms"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/S0097539703436357","volume":"35","author":"J Gao","year":"2005","unstructured":"Gao, J., Zhang, L.: Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM J. Comput. 35(1), 151\u2013169 (2005)","journal-title":"SIAM J. Comput."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M.: Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2495\u20132504 (2017)","DOI":"10.1137\/1.9781611974782.165"},{"issue":"5","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1137\/S0097539794268649","volume":"26","author":"M Katz","year":"1997","unstructured":"Katz, M., Sharir, M.: An expander-based approach to geometric optimization. SIAM J. Comput. 26(5), 1384\u20131408 (1997)","journal-title":"SIAM J. Comput."},{"key":"12_CR15","unstructured":"Katz, M.J., Sharir, M.: Efficient algorithms for optimization problems involving distances in a point set. arXiv:2111.02052 (2021)"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s00453-009-9322-3","volume":"59","author":"L Roditty","year":"2011","unstructured":"Roditty, L., Segal, M.: On bounded leg shortest paths problems. Algorithmica 59(4), 583\u2013600 (2011)","journal-title":"Algorithmica"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.: Planar point location using persistent search trees. Commun. ACM 29, 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1007\/s00454-020-00219-7","volume":"64","author":"H Wang","year":"2020","unstructured":"Wang, H., Xue, J.: Near-optimal algorithms for shortest paths in weighted unit-disk graphs. Discret. Comput. Geom. 64, 1141\u20131166 (2020)","journal-title":"Discret. Comput. Geom."},{"key":"12_CR20","unstructured":"Wang, H., Zhao, Y.: An optimal algorithm for $${L}_1$$ shortest paths in unit-disk graphs. In: Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG), pp. 211\u2013218 (2021)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhao, Y.: Reverse shortest path problem for unit-disk graphs. In: Proceedings of the 17th International Symposium of Algorithms and Data Structures (WADS), pp. 655\u2013668 (2021). https:\/\/arxiv.org\/abs\/2104.14476","DOI":"10.1007\/978-3-030-83508-8_47"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1022429905385","volume":"25","author":"J Zhang","year":"2003","unstructured":"Zhang, J., Lin, Y.: Computation of the reverse shortest-path problem. J. Global Optim. 25(3), 243\u2013261 (2003)","journal-title":"J. Global Optim."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:04:48Z","timestamp":1647389088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}