{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:32:26Z","timestamp":1725496346369},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540435945"},{"type":"electronic","value":"9783540477891"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47789-6_3","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T13:56:19Z","timestamp":1196430979000},"page":"26-35","source":"Crossref","is-referenced-by-count":1,"title":["Balanced Partition of Minimum Spanning Trees"],"prefix":"10.1007","author":[{"given":"Mattias","family":"Andersson","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]},{"given":"Giri","family":"Narasimhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"3_CR1","unstructured":"M. Andersson. Balanced Partition of Minimum Spanning Trees, LUNDFD6\/NFCS-5215\/1-30\/2001, Master thesis, Department of Computer Science, Lund University, 2001."},{"key":"3_CR2","unstructured":"B. Shaleooi. Algoritmer f\u00f6r pl\u00e5tsk\u00e4rning (Eng. transl. Algorithms for cutting sheets of metal), LUNDFD6\/NFCS-5189\/1-44\/2001, Master thesis, Department of Computer Science, Lund University, 2001."},{"key":"3_CR3","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman and Company, San Francisco, 1979."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"E. M. Arkin","year":"1994","unstructured":"E. M. Arkin and R. Hassin. Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics, 55:197\u2013218, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR5","unstructured":"A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for TSP with neighborhoods in the plane. In Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"M. R. Garey, R. L. Graham and D. S. Johnson. Some NP-complete geometric problems. In Proc. 8th Annual ACM Symposium on Theory of Computing, 1976.","DOI":"10.1145\/800113.803626"},{"key":"3_CR7","first-page":"469","volume":"6","author":"J. Gudmundsson","year":"1999","unstructured":"J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing, 6:469\u2013488, 1999.","journal-title":"Nordic Journal of Computing"},{"key":"3_CR8","unstructured":"J. Gudmundsson and C. Levcopoulos. Hardness Result for TSP with Neighborhoods, Technical report, LU-CS-TR:2000-216, Department of Computer Science, Lund University, Sweden, 2000."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"C. Mata and J. S. B. Mitchell. Approximation algorithms for geometric tour and network design problems. In Proc. 11th Annual ACM Symposium on Computational Geometry, pages 360\u2013369, 1995.","DOI":"10.1145\/220279.220318"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"J. S. B. Mitchell","year":"1999","unstructured":"J. S. B. Mitchell. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems. SIAM Journal on Computing, 28(4):1298\u20131309, 1999.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47789-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T06:58:22Z","timestamp":1557039502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47789-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435945","9783540477891"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-47789-6_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}