{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:42:56Z","timestamp":1665780176573},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00784-4","type":"journal-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T19:03:10Z","timestamp":1627066990000},"page":"2642-2660","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local routing in a tree metric 1-spanner"],"prefix":"10.1007","volume":"44","author":[{"given":"Milutin","family":"Brankovic","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9 van","family":"Renssen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"784_CR1","doi-asserted-by":"crossref","unstructured":"Abraham I, Malkhi D (2004) Compact routing on Euclidian metrics. In: Proceedings of the 23rd annual ACM symposium on principles of distributed computing, pp 141\u2013149","DOI":"10.1145\/1011767.1011789"},{"key":"784_CR2","doi-asserted-by":"crossref","unstructured":"Arya SK, Das G, Mount DM, Salowe JS, Smid MHM (1995) Euclidean spanners: short, thin, and lanky. In: Proceedings of the 27th annual ACM symposium on theory of computing","DOI":"10.1145\/225058.225191"},{"key":"784_CR3","unstructured":"Ashvinkumar V, Gudmundsson J, Levcopoulos C, Nilsson BJ, van Renssen A (2019) Local routing in sparse and lightweight geometric graphs. In: Proceedings of the 30th international symposium on algorithms and computation. LIPIcs, vol\u00a0149, pp 30:1\u201330:13"},{"issue":"4","key":"784_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1142\/S021819590200089X","volume":"12","author":"P Bose","year":"2002","unstructured":"Bose P, Brodnik A, Carlsson S, Demaine E, Fleischer R, L\u00f3pez-Ortiz A, Morin P, Munro J (2002) Online routing in convex subdivisions. Int J Comput Geom Appl 12(4):283\u2013296","journal-title":"Int J Comput Geom Appl"},{"issue":"6","key":"784_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 (2015) Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. SIAM J Comput 44(6):1626\u20131649","journal-title":"SIAM J Comput"},{"key":"784_CR6","doi-asserted-by":"crossref","unstructured":"Brankovic M, Gudmundsson J, van Renssen A (2020) Local routing in a tree metric 1-spanner. In: Computing and combinatorics. COCOON 2020. Lecture notes in computer science, vol 12273. Springer, Berlin, pp 174\u2013185","DOI":"10.1007\/978-3-030-58150-3_14"},{"key":"784_CR7","doi-asserted-by":"crossref","unstructured":"Chan THH, Gupta A, Maggs BM, Zhou S (2016) On hierarchical routing in doubling metrics. ACM Trans Algorithms 12(4):55:1\u201355:22","DOI":"10.1145\/2915183"},{"issue":"1","key":"784_CR8","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 (2015) New doubling spanners: better and simpler. SIAM J Comput 44(1):37\u201353","journal-title":"SIAM J Comput"},{"key":"784_CR9","doi-asserted-by":"crossref","unstructured":"Elkin M, Solomon S (2013) Optimal Euclidean spanners: really short, thin and lanky. In: Proceedings of the 45th annual ACM symposium on theory of computing, pp 645\u2013654","DOI":"10.1145\/2488608.2488691"},{"issue":"1","key":"784_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2005.10.001","volume":"35","author":"J Gao","year":"2006","unstructured":"Gao J, Guibas LJ, Nguyen A (2006) Deformable spanners and applications. Comput Geom 35(1):2\u201319","journal-title":"Comput Geom"},{"key":"784_CR11","unstructured":"Gottlieb LA, Roditty L (2008) Improved algorithms for fully dynamic geometric spanners and geometric routing. In: Proceedings of the 19th annual ACM-SIAM symposium on discrete algorithms, pp 591\u2013600"},{"issue":"5","key":"784_CR12","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 (2006) Fast construction of nets in low-dimensional metrics and their applications. SIAM J Comput 35(5):1148\u20131184","journal-title":"SIAM J Comput"},{"issue":"1","key":"784_CR13","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 (1985) Labelling and implicit routing in networks. Comput J 28(1):5\u20138","journal-title":"Comput J"},{"key":"784_CR14","doi-asserted-by":"crossref","unstructured":"Solomon S (2014) 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","DOI":"10.1145\/2591796.2591864"},{"issue":"3","key":"784_CR15","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1137\/120901295","volume":"28","author":"S Solomon","year":"2014","unstructured":"Solomon S, Elkin M (2014) Balancing degree, diameter, and weight in Euclidean spanners. SIAM J Discret Math 28(3):1173\u20131198","journal-title":"SIAM J Discret Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00784-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00784-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00784-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:21:22Z","timestamp":1665778882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00784-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["784"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00784-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,23]]},"assertion":[{"value":"8 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}