{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T11:07:39Z","timestamp":1744888059346},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":8751,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1016\/0304-3975(89)90134-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:07:16Z","timestamp":1027638436000},"page":"181-203","source":"Crossref","is-referenced-by-count":8,"title":["Heuristics for optimum binary search trees and minimum weight triangulation problems"],"prefix":"10.1016","volume":"66","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg-R.","family":"Sack","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90134-5_BIB1","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1137\/0206045","article-title":"A new algorithm for minimum cost binary trees","volume":"4","author":"Garsia","year":"1977","journal-title":"SICOMP"},{"key":"10.1016\/0304-3975(89)90134-5_BIB2","series-title":"M.S. Thesis","article-title":"New results in planar triangulations","author":"Gilbert","year":"1979"},{"key":"10.1016\/0304-3975(89)90134-5_BIB3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1137\/0210031","article-title":"Optimal multi-way search trees","volume":"10","author":"Gottlieb","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90134-5_BIB4","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0121057","article-title":"Optimal computer search trees and variable-length alphabetical codes","volume":"21","author":"Hu","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0304-3975(89)90134-5_BIB5","series-title":"Computational Geometry","first-page":"197","article-title":"Minimum decompositions of polygonal objects","author":"Keil","year":"1985"},{"key":"10.1016\/0304-3975(89)90134-5_BIB6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","article-title":"Minimal triangulations of polygonal domains","volume":"9","author":"Klincsek","year":"1980","journal-title":"Ann. Discrete Math."},{"year":"1973","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","key":"10.1016\/0304-3975(89)90134-5_BIB7"},{"key":"10.1016\/0304-3975(89)90134-5_BIB8","series-title":"Ph.D. Thesis","article-title":"New results about the approximation behavior of the greedy triangulation, Link\u00f6ping Studies in Science and Technology","author":"Levcopoulos","year":"1986"},{"key":"10.1016\/0304-3975(89)90134-5_BIB9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01840358","article-title":"On approximation behavior of the greedy triangulation for convex polygons","volume":"2","author":"Levcopoulos","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(89)90134-5_BIB10","series-title":"Research report, LITH-IDA-R86-11","article-title":"The greedy triangulation heuristic for minimum weight triangulation of convex polygons approximates the optimum","author":"Lingas","year":"1987"},{"key":"10.1016\/0304-3975(89)90134-5_BIB11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(78)90066-2","article-title":"The all nearest neighbor problem for convex polygons","volume":"7","author":"Lee","year":"1987","journal-title":"Inform. Process. Lett."},{"year":"1984","series-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"Mehlhorn","key":"10.1016\/0304-3975(89)90134-5_BIB12"},{"key":"10.1016\/0304-3975(89)90134-5_BIB13","series-title":"Computational Geometry, An Introduction","article-title":"Texts and Monographs in Computer Science","author":"Preparata","year":"1985"},{"key":"10.1016\/0304-3975(89)90134-5_BIB14","first-page":"122","article-title":"Rotation distance, triangulation, and hyperbolic geometry","author":"Sleator","year":"1986","journal-title":"Proc. 18th ACM Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:25:06Z","timestamp":1555179906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0304397589901345"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90134-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}