{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:02:58Z","timestamp":1770994978248,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,7,1]],"date-time":"1979-07-01T00:00:00Z","timestamp":299635200000},"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":[[1979,7]]},"DOI":"10.1016\/0020-0190(79)90104-2","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"31-34","source":"Crossref","is-referenced-by-count":50,"title":["Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation"],"prefix":"10.1016","volume":"9","author":[{"given":"Glenn K.","family":"Manacher","sequence":"first","affiliation":[]},{"given":"Albert L.","family":"Zobrist","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90104-2_BIB1","series-title":"Symp. on New Directions and Recent Results in Algorithms and Complexity","article-title":"Worst-case analysis of a new heuristic for the Travelling Salesman Problem","author":"Christofides","year":"1976"},{"key":"10.1016\/0020-0190(79)90104-2_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/1008328.1008329","article-title":"Big omicron and big omega and big theta","author":"Knuth","year":"1976","journal-title":"SIGACT news"},{"key":"10.1016\/0020-0190(79)90104-2_BIB3","article-title":"On triangulations of a set of points in the plane","author":"Lloyd","year":"1977","journal-title":"Proc. 18th Annual IEEE Conference on the Foundations of Computer Science"},{"key":"10.1016\/0020-0190(79)90104-2_BIB4","article-title":"A fast, space-efficient average-case algorithm for the \u2018greedy\u2019 triangulation of a point set, and a proof that the greedy triangulation is not approximately optimal","author":"Manacher","year":"1978","journal-title":"Proc. Sixteenth Annual Allerton Conference on Communication, Control and Computing"},{"key":"10.1016\/0020-0190(79)90104-2_BIB5","series-title":"Combinatorial Algorithms, Theory and Practice","author":"Reingold","year":"1977"},{"key":"10.1016\/0020-0190(79)90104-2_BIB6","series-title":"Packing and Covering","author":"Rogers","year":"1964"},{"issue":"3","key":"10.1016\/0020-0190(79)90104-2_BIB7","article-title":"Approximation algorithms for the Traveling Salesperson Problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0020-0190(79)90104-2_BIB8","series-title":"Notes on computational geometry","author":"Shamos","year":"1975"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901042?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901042?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T18:23:23Z","timestamp":1554920603000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079901042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,7]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,7]]}},"alternative-id":["0020019079901042"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90104-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,7]]}}}