{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:05:45Z","timestamp":1768269945370,"version":"3.49.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2009,5]]},"abstract":"<jats:p>\n            The Minimum Weight Triangulation problem is to find a triangulation\n            <jats:italic>T*<\/jats:italic>\n            of minimum length for a given set of points\n            <jats:italic>P<\/jats:italic>\n            in the Euclidean plane. It was one of the few longstanding open problems from the famous list of twelve problems with unknown complexity status, published by Garey and Johnson [1979]. Very recently, the problem was shown to be\n            <jats:italic>NP<\/jats:italic>\n            -hard by Mulzer and Rote [2006]. In this article, we present a quasi-polynomial time approximation scheme for Minimum Weight Triangulation.\n          <\/jats:p>","DOI":"10.1145\/1516512.1516517","type":"journal-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T16:47:42Z","timestamp":1242751662000},"page":"1-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["A quasi-polynomial time approximation scheme for minimum weight triangulation"],"prefix":"10.1145","volume":"56","author":[{"given":"Jan","family":"Remy","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelika","family":"Steger","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(93)90016-Y"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875526"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0438-y"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1103-4"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276718"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/237218.237425"},{"key":"e_1_2_1_8_1","unstructured":"Bern M. and Eppstein D. 1997. Approximation algorithms for geometric problems. In Approximation Algorithms for NP-hard Problems D. Hochbaum Ed. PWS Publishing.   Bern M. and Eppstein D. 1997. Approximation algorithms for geometric problems. In Approximation Algorithms for NP-hard Problems D. Hochbaum Ed. PWS Publishing."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/237218.237360"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the International Symposium on Optimal Algorithms, 168--192","author":"Das G."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009320"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00236-5"},{"key":"e_1_2_1_13_1","first-page":"423","article-title":"Automatische Interpolation von Isolinien bei willk\u00fcrlichen St\u00fctzpunken","volume":"77","author":"D\u00fcppe R. D.","year":"1970","journal-title":"Allgemeine Vermessungs-Nachrichten"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222036"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0913058"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574002"},{"key":"e_1_2_1_17_1","unstructured":"Garey M. R. and Johnson D. S. 1979. Computers and Intractability---A Guide to the Theory of NP-Completness.   Garey M. R. and Johnson D. S. 1979. Computers and Intractability---A Guide to the Theory of NP-Completness."},{"key":"e_1_2_1_18_1","unstructured":"Gilbert P. 1979. New results on planar triangulations. M.S. dissertation University of Illinois.  Gilbert P. 1979. New results on planar triangulations. M.S. dissertation University of Illinois."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_98"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.05.004"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 1st Internation Workshop on Parameterized and Exact Computation. 200--212","author":"Hoffmann M."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/179228.179230"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70044-X"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM","author":"Levcopoulos C."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0918"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.21"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM","author":"Mitchell J. S. B.","year":"1996"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/500559.500562"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137859"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90020-4"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.8"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 5th International Symposium on Algorithms and Computation. 423--427","author":"Yang B. T."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1516512.1516517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1516512.1516517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:06Z","timestamp":1750253406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1516512.1516517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["10.1145\/1516512.1516517"],"URL":"https:\/\/doi.org\/10.1145\/1516512.1516517","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]},"assertion":[{"value":"2006-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}