{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:16:13Z","timestamp":1760440573414},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728689"},{"type":"electronic","value":"9783540728702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72870-2_29","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T08:53:10Z","timestamp":1182761590000},"page":"306-316","source":"Crossref","is-referenced-by-count":17,"title":["Minimum Spanning Tree with Neighborhoods"],"prefix":"10.1007","author":[{"given":"Yang","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulai","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: A replacement for voronoi diagrams of near linear size. In: FOCS, pp. 94\u2013103 (2001)","DOI":"10.1109\/SFCS.2001.959884"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1145\/509907.510011","volume-title":"STOC \u201902: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing","author":"S. Arya","year":"2002","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate voronoi diagrams. In: STOC \u201902: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, Montreal, Quebec, Canada, pp. 721\u2013730. ACM Press, New York (2002), doi:10.1145\/509907.510011"},{"key":"29_CR4","unstructured":"Wei, X., Samarabandu, J., Devdhar, R., Siegel, A., Acharya, R., Berezney, R.: Segregation of transcription and replication sites into higher order domains"},{"issue":"3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"E.M. Arkin","year":"1994","unstructured":"Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics\u00a055(3), 197\u2013218 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In: Symposium on Computational Geometry, pp. 360\u2013369 (1995)","DOI":"10.1145\/220279.220318"},{"issue":"4","key":"29_CR7","first-page":"469","volume":"6","author":"J. Gudmundsson","year":"1999","unstructured":"Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for tsp with neighborhoods. Nord. J. Comput.\u00a06(4), 469\u2013488 (1999)","journal-title":"Nord. J. Comput."},{"key":"29_CR8","first-page":"38","volume-title":"Proc. 12th ACM-SIAM Sympos. Discrete Algorithms (SODA)","author":"A. Dumitrescu","year":"2001","unstructured":"Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for tsp with neighborhoods in the plane. In: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 38\u201346. ACM Press, New York (2001)"},{"key":"29_CR9","unstructured":"de Berg, M., Gudmundsson, J., Katz, M., Levcopoulos, C., Overmars, M., van der Stappen, F.: Constant factor approximation algorithms for tspn with fat objects"},{"key":"29_CR10","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"J.S.B. Mitchell","year":"2007","unstructured":"Mitchell, J.S.B.: A ptas for tsp with neighborhoods among fat regions in the plane. In: ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York (2007)"},{"issue":"5","key":"29_CR11","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Mansfield, A.: Determining the thickness of graphs is np-hard. Math. Proc. Cambridge Philos. Soc., 9\u201323 (1983)","DOI":"10.1017\/S030500410006028X"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean TSP and other geometric problems. In: FOCS, pp. 2\u201311 (1996)","DOI":"10.1109\/SFCS.1996.548458"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72870-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:07:17Z","timestamp":1605744437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72870-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728689","9783540728702"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72870-2_29","relation":{},"subject":[]}}