{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:21Z","timestamp":1725551661854},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638902"},{"type":"electronic","value":"9783540696629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_41","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T17:12:11Z","timestamp":1270487531000},"page":"384-393","source":"Crossref","is-referenced-by-count":4,"title":["A branch-and-cut approach for minimum weight triangulation"],"prefix":"10.1007","author":[{"given":"Yoshiaki","family":"Kyoda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiko","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fumihiko","family":"Takeuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Tajima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"41_CR1","unstructured":"D. Applegate, R. Bixby, V. Chvatal and B. Cook. Finding Cuts in the TSP (A preliminary report). Technical Reports 95-05, DIMACS, 1995."},{"key":"41_CR2","unstructured":"M. Berkelaar. lp_solve. Available at ftp:\/\/ftp.es.ele.tue.nl\/pub\/lp_solve."},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In \u201cComputing in Euclidean Geometry\u201d (2nd edition), Lecture Notes Series on Computing, Vol.4, World Scientific, 1995, pp.47\u2013123.","DOI":"10.1142\/9789812831699_0003"},{"key":"41_CR4","unstructured":"S.-W. Cheng, M. J. Golin, and J. C. F. Tsang. Expected case analysis of \u03b2-skeletons with applications to the construction of minimum-weight triangulations. Proc. 7th Canadian Conference of Computational Geometry, 1995, pp.279\u2013284."},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"S.-W. Cheng, N. Katoh and M. Sugai. A study of the LMT-skeleton. Proc. 7th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol.1178, pp.256\u2013265.","DOI":"10.1007\/BFb0009502"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"S.-W. Cheng and Y.-F. Xu. Approaching the largest \u03b2-Skeleton within a minimum weight triangulation. Proc. 12th Annual ACM Symposium on Computational Geometry, 1996, pp.196\u2013203.","DOI":"10.1145\/237218.237360"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"M. T. Dickerson and M. H. Montague. A (usually?) connected subgraph of the minimum weight triangulation. Proc. 12th Annual ACM Symposium on Computational Geometry, 1996, pp.204\u2013213.","DOI":"10.1145\/237218.237364"},{"key":"41_CR8","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/0222036","volume":"22","author":"H. Edelsbrunner","year":"1993","unstructured":"H. Edelsbrunner and T. S. Tan. A quadratic time algorithm for the minmax length triangulation. SIAM J. Comput., 22:527\u2013551, 1993.","journal-title":"SIAM J. Comput."},{"key":"41_CR9","first-page":"13","volume":"4","author":"J. M. Keil","year":"1994","unstructured":"J. M. Keil. Computing a subgraph of the minimum weight triangulation. Computational Geometry Theory and Applications, 4:13\u201326, 1994.","journal-title":"Computational Geometry Theory and Applications"},{"key":"41_CR10","unstructured":"Y. Kyoda. A study of generating minimum weight triangulation within practical time. Master's Thesis, Department of Information Science, University of Tokyo, March 1996. Available at http:\/\/naomi.is.s.u-Tokyo.ac.jp\/"},{"key":"41_CR11","unstructured":"C. Levcopoulos and D. Krznaric. Quasigreedy triangulations approximating the minimum weight triangulation. Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp.392\u2013401."},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"T. Masada, H. Imai and K. Imai. Enumeration of regular triangulations. Proc. 12th Annual ACM Symposium on Computational Geometry, 1996, pp.224\u2013233.","DOI":"10.1145\/237218.237373"},{"issue":"2","key":"41_CR13","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G. L. Nemhauser","year":"1975","unstructured":"G. L. Nemhauser and L. E. Trotter. Vertex packings: structural properties and algorithms. Mathematical Programming, 8,2:232\u2013248, 1975.","journal-title":"Mathematical Programming"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"F. Takeuchi and H. Imai. Enumerating triangulations for products of two simplices and for arbitrary configurations of points. Proc. 3rd International Computing and Combinatorics Computing Conference, Lecture Notes in Computer Science, 1997.","DOI":"10.1007\/BFb0045114"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"C. A. Wang, F. Chin and Y.-F. Xu. A new subgraph of minimum weight triangulation. Proc. 7th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol.1178, pp.266\u2013274.","DOI":"10.1007\/BFb0009503"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T11:14:24Z","timestamp":1549192464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}