{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:41:04Z","timestamp":1742985664296,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_44","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"613-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Routing on Heavy-Path WSPD-Spanners"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Tyler","family":"Tuttle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"44_CR1","doi-asserted-by":"publisher","unstructured":"Aluru, S.: Quadtrees and octrees. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications, chapter 19, 1 edn, pp. 1\u201326. Chapman and Hall\/CRC (2004). https:\/\/doi.org\/10.1201\/9781420035179. ISBN 1-58488-435-5","DOI":"10.1201\/9781420035179"},{"key":"44_CR2","doi-asserted-by":"publisher","unstructured":"Arya, S., Mount, D.M., Smid, M.: Randomized and deterministic algorithms for geometric spanners of small diameter. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 703\u2013712 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365722. ISBN 0-8186-6580-7","DOI":"10.1109\/SFCS.1994.365722"},{"key":"44_CR3","doi-asserted-by":"publisher","unstructured":"Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.: Euclidean spanners: short, thin and lanky. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, pp. 489\u2013498 (1995). https:\/\/doi.org\/10.1145\/225058.225191. ISBN 978-0-89791-718-6","DOI":"10.1145\/225058.225191"},{"key":"44_CR4","unstructured":"Baharifard, F., Farhadi, M., Zarrabi-Zadeh, H.: Routing in well-separated pair decomposition spanners. In: Proceedings of the 1st Iranian Conference on Computational Geometry, pp. 25\u201328 (2018)"},{"issue":"2","key":"44_CR5","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1137\/110832458","volume":"58","author":"N Bonichon","year":"2017","unstructured":"Bonichon, N., Bose, P., De Carufel, J.L., Perkovi\u0107, L., Van Renssen, A.: Upper and lower bounds for online routing on delaunay triangulations. Discrete Comput. Geom. 58(2), 482\u2013504 (2017). https:\/\/doi.org\/10.1137\/110832458","journal-title":"Discrete Comput. Geom."},{"key":"44_CR6","doi-asserted-by":"publisher","unstructured":"Bonichon, N., Bose, P., De Carufel, J.L., Despr\u00e9, V., Hill, D., Smid, M.: Improved routing on the Delaunay triangulation. In: 26th Annual European Symposium on Algorithms, pp. 1\u201313 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.22. ISBN 978-3-95977-081-1","DOI":"10.4230\/LIPIcs.ESA.2018.22"},{"issue":"4","key":"44_CR7","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput. 33(4), 937\u2013951 (2004). https:\/\/doi.org\/10.1137\/S0097539700369387","journal-title":"SIAM J. Comput."},{"issue":"6","key":"44_CR8","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1137\/140988103","volume":"44","author":"P Bose","year":"2015","unstructured":"Bose, P., Fagerberg, R., Van Renssen, A., Verdonschot, S.: Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. SIAM J. Comput. 44(6), 1626\u20131649 (2015)","journal-title":"SIAM J. Comput."},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-319-62127-2_18","volume-title":"Algorithms and Data Structures","author":"P Bose","year":"2017","unstructured":"Bose, P., De Carufel, J.-L., Dujmovi\u0107, V., Paradis, F.: Local routing in spanners based on WSPDs. In: WADS 2017. LNCS, vol. 10389, pp. 205\u2013216. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_18"},{"issue":"1","key":"44_CR10","first-page":"212","volume":"11","author":"P Bose","year":"2020","unstructured":"Bose, P., De Carufel, J.L., Devillers, O.: Olivier: expected complexity of routing in $$\\theta _6$$ and half-$$\\theta _6$$ graphs. J. Comput. Geom. 11(1), 212\u2013234 (2020)","journal-title":"J. Comput. Geom."},{"issue":"1","key":"44_CR11","first-page":"1","volume":"12","author":"P Bose","year":"2021","unstructured":"Bose, P., De Carufel, J.L., Dujmovi\u0107, V., Paradis, F.: Local routing in spanners based on WSPDs. J. Comput. Geom. 12(1), 1\u201334 (2021)","journal-title":"J. Comput. Geom."},{"issue":"1","key":"44_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"PB Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to $$k$$-nearest-neighbors and $$n$$-body potential fields. J. ACM 42(1), 67\u201390 (1995). https:\/\/doi.org\/10.1145\/200836.200853","journal-title":"J. ACM"},{"key":"44_CR13","doi-asserted-by":"publisher","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 56\u201365 (1987). https:\/\/doi.org\/10.1145\/28395.28402. ISBN 978-0-89791-221-1","DOI":"10.1145\/28395.28402"},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"issue":"1","key":"44_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/S0097539703436357","volume":"35","author":"J Gao","year":"2006","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 (2006). https:\/\/doi.org\/10.1137\/S0097539703436357","journal-title":"SIAM J. Comput."},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms. Number 173 in Mathematical Surveys and Monographs. American Mathematical Society, USA (2011). ISBN 978-0-8218-4911-8","DOI":"10.1090\/surv\/173"},{"issue":"5","key":"44_CR17","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35(5), 1148\u20131184 (2006). https:\/\/doi.org\/10.1137\/S0097539704446281","journal-title":"SIAM J. Comput."},{"issue":"3","key":"44_CR18","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/s00453-017-0308-2","volume":"80","author":"H Kaplan","year":"2017","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Routing in unit disk graphs. Algorithmica 80(3), 830\u2013848 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0308-2","journal-title":"Algorithmica"},{"issue":"1","key":"44_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discret. Comput. Geom. 7(1), 13\u201328 (1992). https:\/\/doi.org\/10.1007\/BF02187821","journal-title":"Discret. Comput. Geom."},{"key":"44_CR20","unstructured":"Mulzer, W., Willert, M.: Compact routing in unit disk graphs. In: ISAAC, vol. 181 of LIPIcs, pp. 1\u201314. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"44_CR21","doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007). ISBN 978-0-521-81513-0","DOI":"10.1017\/CBO9780511546884"},{"key":"44_CR22","unstructured":"Ruppert, J., Seidel, R.: Approximating the $$d$$-dimensional complete Euclidean graph. In: Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG 1991), pp. 207\u2013210 (1991)"},{"issue":"3","key":"44_CR23","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362\u2013391 (1983). https:\/\/doi.org\/10.1016\/0022-0000(83)90006-5","journal-title":"J. Comput. Syst. Sci."},{"key":"44_CR24","unstructured":"Tuttle, T.G.: Routing on heavy path WSPD spanners. Master\u2019s thesis, Carleton University, Ottawa, Canada (2020)"},{"key":"44_CR25","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"AC Yao","year":"1981","unstructured":"Yao, A.C.: On constructing minimum spanning trees in $$k$$-dimensional space and related problems. SIAM J. Comput. 11, 721\u2013736 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:29:49Z","timestamp":1645183789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}