{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:11:39Z","timestamp":1748751099918,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_3","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"23-34","source":"Crossref","is-referenced-by-count":1,"title":["Competitive Local Routing with Constraints"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sander","family":"Verdonschot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In: WG, pp. 266\u2013278 (2010)","DOI":"10.1007\/978-3-642-16926-7_25"},{"issue":"04","key":"3_CR2","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.D., Fleischer, R., L\u00f3pez-Ortiz, A., Morin, P., Munro, I.J.: Online routing in convex subdivisions. Int. J. Comput. Geom. App. 12(04), 283\u2013295 (2002)","journal-title":"Int. J. Comput. Geom. App."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half- $$\\theta _6$$ -graph. In: SODA, pp. 1319\u20131328 (2012). To appear in SIAM J. Comput","DOI":"10.1137\/1.9781611973099.104"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-29344-3_8","volume-title":"LATIN 2012: Theoretical Informatics","author":"P Bose","year":"2012","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: On plane constrained bounded-degree spanners. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 85\u201396. Springer, Heidelberg (2012)"},{"key":"3_CR5","unstructured":"Bose, P., Fagerberg, R., van Renssen, A.,Verdonschot, S.: Competitive local routing with constraints. ArXiv e-prints (2014). arXiv:1412.0760 [cs.CG]"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bose, P., Keil, J.M.: On the stretch factor of the constrained Delaunay triangulation. In: ISVD, pp. 25\u201331 (2006)","DOI":"10.1109\/ISVD.2006.28"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-54423-1_10","volume-title":"LATIN 2014: Theoretical Informatics","author":"P Bose","year":"2014","unstructured":"Bose, P., van Renssen, A.: Upper bounds on the spanning ratio of constrained theta-graphs. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 108\u2013119. Springer, Heidelberg (2014)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: STOC, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"3_CR9","unstructured":"Das, G.: The visibility graph contains a bounded-degree spanner. In: CCCG, pp. 70\u201375 (1997)"},{"volume-title":"Guide to Wireless Sensor Networks","year":"2009","key":"3_CR10","unstructured":"Misra, S.C., Woungang, I., Misra, S. (eds.): Guide to Wireless Sensor Networks. Springer, London (2009)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-03073-4_43","volume-title":"Mathematical Theory and Computational Practice","author":"H R\u00e4cke","year":"2009","unstructured":"R\u00e4cke, H.: Survey on oblivious routing strategies. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 419\u2013429. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:11:57Z","timestamp":1748704317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}