{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:25:03Z","timestamp":1766136303655},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518594"},{"type":"electronic","value":"9783540468318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51859-2_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:18:30Z","timestamp":1330204710000},"page":"9-13","source":"Crossref","is-referenced-by-count":12,"title":["There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees"],"prefix":"10.1007","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"2_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Massachusetts, 1974)."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"L. Paul Chew, There is a Planar Graph Almost as Good as the Complete Graph, Proc. of the 2nd Ann. ACM Symp. on Computational Geometry, Yorktown Heights, 1986.","DOI":"10.1145\/10515.10534"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"D. Cheriton, R.E. Tarjan, Finding Minimum Spanning Trees, SIAM J. Comput., 5 (1976), pp. 724\u2013742.","journal-title":"SIAM J. Comput."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"D.P. Dobkin, S.J. Friedman, and K.J. Supowit, Delaunay Graphs are Almost as Good as Complete Graphs, Proc. of the 28th Ann. IEEE Symposium on Foundations of Computer Science, Los Angeles, 1987.","DOI":"10.1109\/SFCS.1987.18"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"M. Keil, Approximating the Complete Euclidean Graph, Proc. of the 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, 1988.","DOI":"10.1007\/3-540-19487-8_23"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"M. Keil and C. Gutwin, The Delaunay Triangulation Closely Approximates the Complete Euclidean Graph, to appear in Proc. of the 1st Canadian Workshop on Algorithms and Data Structures, Ottawa, August 1989.","DOI":"10.1007\/3-540-51542-9_6"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"D.G. Kirkpatrick, A Note on Delaunay and Optimal Triangulations, Information Processing Letters, Vol. 10, No. 3, 1980.","DOI":"10.1016\/0020-0190(80)90062-9"},{"key":"2_CR8","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction, Texts and Monographs in Computer Science, Springer Verlag, New York."}],"container-title":["Lecture Notes in Computer Science","Optimal Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51859-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:05Z","timestamp":1605648185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51859-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518594","9783540468318"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-51859-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}