{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:45:05Z","timestamp":1766137505710,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_14","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"174-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Local Routing in a Tree Metric 1-Spanner"],"prefix":"10.1007","author":[{"given":"Milutin","family":"Brankovic","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6778-7990","authenticated-orcid":false,"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9294-9947","authenticated-orcid":false,"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D.: Compact routing on Euclidian metrics. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 141\u2013149 (2004)","DOI":"10.1145\/1011767.1011789"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Arya, S.K., Das, G., Mount, D.M., Salowe, J.S., Smid, M.H.M.: Euclidean spanners: short, thin, and lanky. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995)","DOI":"10.1145\/225058.225191"},{"key":"14_CR3","unstructured":"Ashvinkumar, V., Gudmundsson, J., Levcopoulos, C., Nilsson, B.J., van Renssen, A.: Local routing in sparse and lightweight geometric graphs. In: Proceedings of the 30th International Symposium on Algorithms and Computation. LIPIcs, vol. 149, pp. 30:1\u201330:13 (2019)"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1142\/S021819590200089X","volume":"12","author":"P Bose","year":"2002","unstructured":"Bose, P., et al.: Online routing in convex subdivisions. Int. J. Comput. Geom. Appl. 12(4), 283\u2013296 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1137\/140988103","volume":"44","author":"P Bose","year":"2015","unstructured":"Bose, P., Fagerberg, R., 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":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/130930984","volume":"44","author":"T Chan","year":"2015","unstructured":"Chan, T., Li, M., Ning, L., Solomon, S.: New doubling spanners: better and simpler. SIAM J. Comput. 44(1), 37\u201353 (2015)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"14_CR7","first-page":"55:1","volume":"12","author":"THH Chan","year":"2016","unstructured":"Chan, T.H.H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. ACM Trans. Algorithms 12(4), 55:1\u201355:22 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Elkin, M., Solomon, S.: Optimal Euclidean spanners: really short, thin and lanky. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pp. 645\u2013654 (2013)","DOI":"10.1145\/2488608.2488691"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. Comput. J. 28(1), 5\u20138 (1985)","journal-title":"Comput. J."},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1137\/120901295","volume":"28","author":"S Solomon","year":"2014","unstructured":"Solomon, S., Elkin, M.: Balancing degree, diameter, and weight in Euclidean spanners. SIAM J. Discrete Math. 28(3), 1173\u20131198 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Solomon, S.: From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 363\u2013372 (2014)","DOI":"10.1145\/2591796.2591864"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:40:46Z","timestamp":1619206846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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":"10.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}