{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:33Z","timestamp":1725511773884},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_16","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T19:41:23Z","timestamp":1179949283000},"page":"175-187","source":"Crossref","is-referenced-by-count":1,"title":["Light Orthogonal Networks with Constant Geometric Dilation"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., et al.: On sparse spanners of weighted graphs. Discrete Comput. Geom.\u00a09, 81\u2013100 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11602613_7","volume-title":"Algorithms and Computation","author":"B. Aronov","year":"2005","unstructured":"Aronov, B., et al.: Sparse geometric graphs with small dilation. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 50\u201359. Springer, Heidelberg (2005)"},{"key":"16_CR3","first-page":"489","volume-title":"Proc. 27th STOC","author":"S. Arya","year":"1995","unstructured":"Arya, S., et al.: Euclidean spanners: short, thin, and lanky. In: Proc. 27th STOC, pp. 489\u2013498. ACM Press, New York (1995)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P. Bose","year":"2005","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. Algorithmica\u00a042, 249\u2013264 (2005)","journal-title":"Algorithmica"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1142\/S0218195995000088","volume":"5","author":"B. Chandra","year":"1995","unstructured":"Chandra, B., et al.: New sparseness results on graph spanners. Int. J. Comput. Geometry Appl.\u00a05, 125\u2013144 (1995)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Computer Sys. Sci.\u00a039, 205\u2013219 (1989)","journal-title":"J. Computer Sys. Sci."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-51859-2_15","volume-title":"Optimal Algorithms","author":"G. Das","year":"1989","unstructured":"Das, G., Joseph, D.: Which triangulations approximate the complete graph? In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol.\u00a0401, pp. 168\u2013192. Springer, Heidelberg (1989)"},{"key":"16_CR8","first-page":"215","volume-title":"Proc. 6th SODA","author":"G. Das","year":"1995","unstructured":"Das, G., Narasimhan, G., Salowe, J.S.: A new way to weigh malnourished Euclidean graphs. In: Proc. 6th SODA, pp. 215\u2013222. ACM Press, New York (1995)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D.P. Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom.\u00a05, 399\u2013407 (1990)","journal-title":"Discrete Comput. Geom."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.comgeo.2005.07.004","volume":"36","author":"A. Dumitrescu","year":"2006","unstructured":"Dumitrescu, A., et al.: On the geometric dilation of closed curves, graphs, and point sets. Comput. Geom.\u00a036, 16\u201338 (2006)","journal-title":"Comput. Geom."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00453-005-1203-9","volume":"44","author":"A. Ebbers-Baumann","year":"2006","unstructured":"Ebbers-Baumann, A., Gr\u00fcne, A., Klein, R.: On the geometric dilation of finite point sets. Algorithmica\u00a044, 137\u2013149 (2006)","journal-title":"Algorithmica"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0925-7721(03)00046-4","volume":"27","author":"A. Ebbers-Baumann","year":"2004","unstructured":"Ebbers-Baumann, A., et al.: A fast algorithm for approximating the detour of a polygonal chain. Comput. Geom.\u00a027, 123\u2013134 (2004)","journal-title":"Comput. Geom."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. North-Holland, Amsterdam (2000)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"M. Keil","year":"1992","unstructured":"Keil, M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom.\u00a07, 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45841-7_20","volume-title":"STACS 2002","author":"S. Langerman","year":"2002","unstructured":"Langerman, S., Morin, P., Soss, M.: Computing the maximum detour and spanning ratio of planar chains, trees and cycles. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 250\u2013261. Springer, Heidelberg (2002)"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01758846","volume":"8","author":"C. Levcopoulos","year":"1992","unstructured":"Levcopoulos, C., Lingas, A.: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica\u00a08, 251\u2013256 (1992)","journal-title":"Algorithmica"},{"key":"16_CR17","first-page":"287","volume-title":"Computational geometry and topological network design","author":"J. MacGregor Smith","year":"1992","unstructured":"MacGregor Smith, J., Winter, P.: Computing in Euclidean geometry. In: Computational geometry and topological network design, pp. 287\u2013385. World Scientific, Singapore (1992)"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:11:46Z","timestamp":1605744706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_16","relation":{},"subject":[]}}