{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:50Z","timestamp":1725664130750},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_230","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:25Z","timestamp":1330261765000},"page":"11-20","source":"Crossref","is-referenced-by-count":2,"title":["Constructing degree-3 spanners with other sparseness properties"],"prefix":"10.1007","author":[{"given":"Gautam","family":"Das","sequence":"first","affiliation":[]},{"given":"Paul J.","family":"Heffernan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"I. Alth\u00f6fer, G. Das, D.P. Dobkin, D. Joseph, J. Soares: On Sparse Spanners of Weighted Graphs. Discrete and Computational Geometry, 9, 1993, pp. 81\u2013100","journal-title":"Discrete and Computational Geometry"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"B. Chandra, G. Das, G. Narasimhan, J. Soares: New Sparseness Results on Graph Spanners. ACM Symposium on Computational Geometry, 1992, pp. 192\u2013201","DOI":"10.1145\/142675.142717"},{"key":"2_CR3","unstructured":"G. Das: Approximation Schemes in Computational Geometry. PhD Thesis, CS Dept, Univ of Wisconsin-Madison, 1990"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"G. Das, P. Heffernan, G. Narasimhan: Optimally Sparse Spanners in 3-Dimensional Euclidean Space. ACM Symposium on Computational Geometry, 1993, pp. 53\u201362","DOI":"10.1145\/160985.160998"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"G. Das, D. Joseph: Which Triangulations Approximate the Complete Graph? International Symposium on Optimal Algorithms, LNCS, Springer-Verlag, 1989","DOI":"10.1007\/3-540-51859-2_15"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D.P. Dobkin","year":"1990","unstructured":"D.P. Dobkin, S.J. Friedman, K.J. Supowit: Delaunay Graphs are Almost as Good as Complete Graphs. Discrete and Computational Geometry, 5, 1990, pp. 399\u2013407","journal-title":"Discrete and Computational Geometry"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"J.M. Keil: Approximating the Complete Euclidean Graph. SWAT, LNCS, Springer-Verlag, 1989","DOI":"10.1007\/3-540-19487-8_23"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos, A. Lingas: There are Planar Graphs Almost as Good as the Complete Graphs and as Short as the Minimum Spanning Trees. Symposium on Optimal Algorithms, LNCS, Springer-Verlag, 1989, pp. 9\u201313","DOI":"10.1007\/3-540-51859-2_2"},{"key":"2_CR9","unstructured":"D. Rupert, R. Seidel: Approximating the d-Dimensional Complete Euclidean Graph. Canadian Conference on Computational Geometry, 1991, pp. 207\u2013210"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"J.S. Salowe: Construction of Multidimensional Spanner Graphs with Applications to Minimum Spanning Trees. ACM Symposium on Computational Geometry, 1991, pp. 256\u2013261","DOI":"10.1145\/109648.109677"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"J.S. Salowe: On Euclidean Spanner Graphs with Small Degree. ACM Symposium on Computational Geometry, 1992, pp. 186\u2013191","DOI":"10.1145\/142675.142716"},{"key":"2_CR12","unstructured":"J. Soares: Graph Spanners. Ph.D Thesis, Univ. of Chicago Technical Report CS 92-14, 1992"},{"key":"2_CR13","unstructured":"J. Soares: Approximating Complete Euclidean Graphs by Bounded Degree Graphs. Manuscript, 1991"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02574695","volume":"6","author":"P.M. Vaidya","year":"1991","unstructured":"P.M. Vaidya: A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. Discrete and Computational Geometry, 6, 1991, pp. 369\u2013381","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_230.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:05Z","timestamp":1605647585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_230","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}