{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:28Z","timestamp":1751342848315,"version":"3.41.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1009776619164","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:50:41Z","timestamp":1040597441000},"page":"361-369","source":"Crossref","is-referenced-by-count":1,"title":["Constant-Level Greedy Triangulations Approximate the MWT Well"],"prefix":"10.1007","volume":"2","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Franz","family":"Aurenhammer","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]},{"given":"Yin-Feng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"189954_CR1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02712872","volume":"16","author":"O. Aichholzer","year":"1996","unstructured":"O. Aichholzer, F. Aurenhammer, S.-W. Chen, N. Katoh, G. Rote, M. Taschwer, and Y.-F. Xu, \u201cTriangulations intersect nicely,\u201d Discrete & Computational Geometry, vol. 16, pp. 339\u2013359, 1996 (special issue).","journal-title":"Discrete & Computational Geometry"},{"key":"189954_CR2","series-title":"SFB-Report","volume-title":"Optimal graph orientation with storage applications","author":"O. Aichholzer","year":"1995","unstructured":"O. Aichholzer, F. Aurenhammer, and G. Rote, \u201cOptimal graph orientation with storage applications,\u201d SFB-Report F003\u201351 (Optimierung and Kontrolle), TU Graz, Austria, 1995."},{"key":"189954_CR3","doi-asserted-by":"crossref","unstructured":"M. Dickerson, R.L. Drysdale, S. McElfresh, and E. Welzl, \u201cFast greedy triangulation algorithms,\u201d Proc. 10th Ann. ACM Symp., Computational Geometry, pp. 211\u2013220, 1994.","DOI":"10.1145\/177424.177649"},{"key":"189954_CR4","volume-title":"Planar minimum-weight triangulations","author":"J. Jansson","year":"1995","unstructured":"J. Jansson, \u201cPlanar minimum-weight triangulations,\u201d MS Thesis, Rep. LU-CS-EX:95\u201316, Lund University, Sweden, 1995."},{"key":"189954_CR5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(87)90170-0","volume":"25","author":"C. Levcopoulos","year":"1987","unstructured":"C. Levcopoulos, \u201cAn \u03a9(\n$$\\sqrt n $$\n) lower bound for the nonoptimality of the greedy triangulation,\u201d Information Processing Letters, vol. 25, pp. 247\u2013251, 1987.","journal-title":"Information Processing Letters"},{"key":"189954_CR6","unstructured":"C. Levcopoulos and D. Krznaric, \u201cQuasi-greedy triangulations approximating the minimum weight triangulation,\u201d Proc. 7th ACM-SIAM Symp. Discrete Algorithms, pp. 392\u2013401, 1996."},{"key":"189954_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01840358","volume":"2","author":"C. Levcopoulos","year":"1987","unstructured":"C. Levcopoulos and A. Lingas, \u201cOn approximation behaviour of the greedy triangulation for convex polygons,\u201d Algorithmica, vol. 2, pp. 175\u2013193, 1987.","journal-title":"Algorithmica"},{"key":"189954_CR8","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos and A. Lingas, \u201cGreedy triangulation approximates the minimum weight triangulation and can be computed in linear time in the average case,\u201d Report LU-CS-TR:92\u2013105, Dept. of Computer Science, Lund University, 1992.","DOI":"10.1007\/3-540-54029-6_163"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009776619164.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009776619164\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009776619164.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:13:57Z","timestamp":1751282037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009776619164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["189954"],"URL":"https:\/\/doi.org\/10.1023\/a:1009776619164","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}