{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:59:56Z","timestamp":1649098796490},"reference-count":6,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0020-0190(00)00062-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:44:54Z","timestamp":1027651494000},"page":"253-255","source":"Crossref","is-referenced-by-count":1,"title":["A lower bound for approximating the geometric minimum weight matching"],"prefix":"10.1016","volume":"74","author":[{"given":"Gautam","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00062-4_ID005","series-title":"Proc. 15th Annual ACM Symp. on Theory of Computing","first-page":"80","article-title":"Lower bounds for algebraic computation trees","author":"Ben-Or","year":"1983"},{"key":"10.1016\/S0020-0190(00)00062-4_ID006","series-title":"Proc. 8th Canadian Conf. Computational Geometry","first-page":"155","article-title":"Lower bounds for computing geometric spanners and approximate shortest paths","author":"Chen","year":"1996"},{"key":"10.1016\/S0020-0190(00)00062-4_ID007","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/PL00009183","article-title":"On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees","volume":"Vol. 19","author":"Das","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(00)00062-4_ID008","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0020-0190(00)00062-4_ID009","series-title":"Proc. 30th Annual ACM Symp. on Theory of Computing","first-page":"540","article-title":"Approximating geometrical graphs via \u201cspanners\u201d and \u201cbanyans\u201d","author":"Rao","year":"1998"},{"key":"10.1016\/S0020-0190(00)00062-4_ID010","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1137\/0218080","article-title":"Geometry helps in matching","volume":"Vol. 18","author":"Vaidya","year":"1989","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000624?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000624?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T08:24:58Z","timestamp":1555230298000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":6,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0020019000000624"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00062-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}