{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:00Z","timestamp":1759335780131},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0166-218x(94)90133-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"55-66","source":"Crossref","is-referenced-by-count":13,"title":["Euclidean spanner graphs with degree four"],"prefix":"10.1016","volume":"54","author":[{"given":"Jeffrey S.","family":"Salowe","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90133-3_BIB1","doi-asserted-by":"crossref","unstructured":"I. Alth\u00f6fer, G. Das, D. Dobkin, D. Joseph and J. Soares, On sparse spanners of weighted graphs, Discrete Comput. Geom., to appear.","DOI":"10.1007\/BF02189308"},{"key":"10.1016\/0166-218X(94)90133-3_BIB2","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/142675.142717","article-title":"New sparseness results on graph spanners","author":"Chandra","year":"1992","journal-title":"Proceedings Eighth ACM Symposium on Computational Geometry"},{"key":"10.1016\/0166-218X(94)90133-3_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","article-title":"There are planar graphs almost as good as the complete graph","volume":"39","author":"Chew","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(94)90133-3_BIB4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-51859-2_15","article-title":"Which triangulations approximate the complete graph","author":"Das","year":"1989","journal-title":"International Symposium on Optimal Algorithms"},{"key":"10.1016\/0166-218X(94)90133-3_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01890115","article-title":"Efficient algorithms for agglomerative hierarchical clustering methods","volume":"1","author":"Day","year":"1984","journal-title":"J. Classification"},{"key":"10.1016\/0166-218X(94)90133-3_BIB6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02187801","article-title":"Delaunay graphs are almost as good as complete graphs","volume":"5","author":"Dobkin","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(94)90133-3_BIB7","unstructured":"P. Heffernan, Personal communication."},{"key":"10.1016\/0166-218X(94)90133-3_BIB8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","article-title":"Classes of graphs which approximate the complete Euclidean graph","volume":"7","author":"Keil","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(94)90133-3_BIB9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/3-540-51859-2_2","article-title":"There are planar graphs almost as good as the complete graph and as short as the minimum spanning trees","author":"Levcopoulos","year":"1989","journal-title":"Symposium on Optimal Algorithms"},{"key":"10.1016\/0166-218X(94)90133-3_BIB10","first-page":"207","article-title":"Approximating the d-dimensional complete Euclidean graph","author":"Ruppert","year":"1991","journal-title":"Proceedings of the 3rd Canadian Conference on Computational Geometry"},{"key":"10.1016\/0166-218X(94)90133-3_BIB11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1142\/S0218195991000098","article-title":"Constructing multidimensional spanner graphs","volume":"1","author":"Salowe","year":"1991","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0166-218X(94)90133-3_BIB12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.2307\/2690391","article-title":"How small is a unit ball?","volume":"62","author":"Smith","year":"1989","journal-title":"Math. Mag."},{"key":"10.1016\/0166-218X(94)90133-3_BIB13","series-title":"Tech. Rept. CS 92-05","article-title":"Approximating Euclidean distances by small degree graphs","author":"Soares","year":"1992"},{"key":"10.1016\/0166-218X(94)90133-3_BIB14","author":"Soares","year":"1992","journal-title":"Graph spanners: a survey"},{"key":"10.1016\/0166-218X(94)90133-3_BIB15","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02574695","article-title":"A sparse graph almost as good as the complete graph on points in K dimensions","volume":"6","author":"Vaidya","year":"1991","journal-title":"Discrete Comput. Geom."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:28:54Z","timestamp":1555136934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0166218X94901333"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90133-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}