{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:02:28Z","timestamp":1743019348663,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206238"},{"type":"electronic","value":"9783031206245"}],"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-031-20624-5_42","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"696-712","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local Routing Algorithms on\u00a0Euclidean Spanners with\u00a0Small Diameter"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Garito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D.: Compact routing on euclidean metrics. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. 23, Jul 2004","DOI":"10.1145\/1011767.1011789"},{"key":"42_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100253","volume":"37","author":"AR Ahmed","year":"2020","unstructured":"Ahmed, A.R., et al.: Graph spanners: A tutorial review. Comput. Sci. Rev. 37, 100253 (2020)","journal-title":"Comput. Sci. Rev."},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Arya, S., Das, G., Mount, D., Salowe, J., Smid, M.: Euclidean spanners: Short, thin, and lanky. In: Proceedings of the 27th ACM STOC, Mar1996","DOI":"10.1145\/225058.225191"},{"issue":"2","key":"42_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0925-7721(99)00014-0","volume":"13","author":"S Arya","year":"1999","unstructured":"Arya, S., Mount, D.M., Smid, M.H.M.: Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Comput. Geom. 13(2), 91\u2013107 (1999)","journal-title":"Comput. Geom."},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-16926-7_25","volume-title":"Graph Theoretic Concepts in Computer Science","author":"N Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 266\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_25"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-14165-2_3","volume-title":"Automata, Languages and Programming","author":"N Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: Plane spanners of maximum degree six. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 19\u201330. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_3"},{"issue":"1","key":"42_CR7","first-page":"41","volume":"1","author":"P Bose","year":"2010","unstructured":"Bose, P., Carmi, P., Collette, S., Smid, M.: On the stretch factor of convex delaunay graphs. J. Comput. Geo. 1(1), 41\u201356 (2010)","journal-title":"J. Comput. Geo."},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2015.12.017","volume":"616","author":"P Bose","year":"2016","unstructured":"Bose, P., Carufel, J.D., Morin, P., van Renssen, A., Verdonschot, S.: Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci. 616, 70\u201393 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half-$$\\Theta _6$$-graph. In: Rabani, Y. (ed.) Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 Jan 2012, pp. 1319\u20131328. SIAM (2012)","DOI":"10.1137\/1.9781611973099.104"},{"issue":"6","key":"42_CR10","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."},{"issue":"6","key":"42_CR11","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Networks 7(6), 609\u2013616 (2001)","journal-title":"Wirel. Networks"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Chan, T.H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. ACM Trans. Algorithms 12(4), 55:1\u201355:22 (2016)","DOI":"10.1145\/2915183"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Chew, P.: There is a planar graph almost as good as the complete graph. In: Proceedings of the Second Annual Symposium on Computational Geometry, SCG 1986, New York, USA, pp. 169\u2013177. Association for Computing Machinery (1986)","DOI":"10.1145\/10515.10534"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"42_CR15","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory, 4th edn., vol. 173, Graduate texts in mathematics. Springer (2012). https:\/\/doi.org\/10.1007\/978-1-4612-9967-7","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"42_CR16","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)","journal-title":"Numer. Math."},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Elkin, M., Solomon, S.: Optimal euclidean spanners: Really short, thin, and lanky. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. 62, Jul 2012","DOI":"10.1145\/2488608.2488691"},{"key":"42_CR18","unstructured":"Hoedemakers, C.: Geometric spanner networks master thesis (2015)"},{"key":"42_CR19","doi-asserted-by":"publisher","unstructured":"Kao, M., (ed.) Encyclopedia of Algorithms - 2016 edn. Springer (2016). https:\/\/doi.org\/10.1007\/978-0-387-30162-4","DOI":"10.1007\/978-0-387-30162-4"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: MobiCom, pp. 243\u2013254. ACM (2000)","DOI":"10.1145\/345910.345953"},{"key":"42_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"SWAT 88","author":"JM Keil","year":"1988","unstructured":"Keil, J.M.: Approximating the complete euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 208\u2013213. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19487-8_23"},{"issue":"1","key":"42_CR22","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. Dis. Comput. Geometry 7(1), 13\u201328 (1992). https:\/\/doi.org\/10.1007\/BF02187821","journal-title":"Dis. Comput. Geometry"},{"key":"42_CR23","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, 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Le, H., Solomon, S.: Truly optimal euclidean spanners. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), Los Alamitos, CA, USA, pp. 1078\u20131100. IEEE Computer Society, Nov 2019","DOI":"10.1109\/FOCS.2019.00069"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Le, H., Solomon, S.: Truly optimal euclidean spanners. SIAM J. Comput. FOCS 19-135 (2022)","DOI":"10.1137\/20M1317906"},{"key":"42_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, New York, NY, USA (2007)"},{"key":"42_CR27","doi-asserted-by":"crossref","unstructured":"Okabe, A., Boots, B., Sugihara, K., Chiu, S.N., Kendall, D.G.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Second edn.. Wiley Series in Probability and Mathematical Statistics. Wiley (2000)","DOI":"10.1002\/9780470317013"},{"key":"42_CR28","doi-asserted-by":"crossref","unstructured":"Paul Chew, L.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci. 39(2), 205\u2013219 (1989)","DOI":"10.1016\/0022-0000(89)90044-5"},{"issue":"6","key":"42_CR29","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"WW Pugh","year":"1990","unstructured":"Pugh, W.W.: Skip lists: A probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"42_CR30","unstructured":"Ruppert, J., Seidel, R.: Approximation algorithms for shortest path motion planning. In: Proceedings of the 3rd Canadian Conference on Computational Geometry, pp. 207\u2013210 (1991)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T19:55:39Z","timestamp":1728244539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","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":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","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":"114","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":"46","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":"40% - 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":"4","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":"8.7","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)"}}]}}