{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:48:30Z","timestamp":1725522510894},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_23","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"213-222","source":"Crossref","is-referenced-by-count":13,"title":["On Approximating the TSP with Intersecting Neighborhoods"],"prefix":"10.1007","author":[{"given":"Khaled","family":"Elbassioni","sequence":"first","affiliation":[]},{"given":"Aleksei V.","family":"Fishkin","sequence":"additional","affiliation":[]},{"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","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"},{"issue":"5","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Nearly linear time approximation schemes for euclidean TSP and other geometric problems. J. ACM\u00a045(5), 1\u201330 (1998)","journal-title":"J. ACM"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jalgor.2005.01.010","volume":"57","author":"M. Berg de","year":"2005","unstructured":"de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with Neighborhoods of varying size. J. of Algorithms\u00a057, 22\u201336 (2005)","journal-title":"J. of Algorithms"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0196-6774(03)00047-6","volume":"48","author":"A. Dumitrescu","year":"2003","unstructured":"Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms\u00a048(1), 135\u2013159 (2003)","journal-title":"J. Algorithms"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1007\/11523468_90","volume-title":"Automata, Languages and Programming","author":"K. Elbassioni","year":"2005","unstructured":"Elbassioni, K., Fishkin, A.V., Mustafa, N., Sitters, R.: Approximation algorithms for Euclidean group TSP. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1115\u20131126. Springer, Heidelberg (2005)"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N. Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms\u00a037(1), 66\u201384 (2000)","journal-title":"J. Algorithms"},{"issue":"4","key":"23_CR7","first-page":"469","volume":"6","author":"J. Gudmundsson","year":"1999","unstructured":"Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for TSP with neighborhoods. Nordic J. Computing\u00a06(4), 469\u2013488 (1999)","journal-title":"Nordic J. Computing"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proc. 35th Annual ACM Symposium on Theory of Computing, pp. 585\u2013594 (2003)","DOI":"10.1145\/780542.780628"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In: Proc. 11th Annual ACM Symposium on Computational Geometry, pp. 360\u2013369 (1995)","DOI":"10.1145\/220279.220318"},{"key":"23_CR10","first-page":"633","volume-title":"Geometric shortest paths and network optimization","author":"J.S.B. Mitchel","year":"2000","unstructured":"Mitchel, J.S.B.: Handbook of computational geometry. In: Geometric shortest paths and network optimization, pp. 633\u2013701. Elsevier, North-Holland, Amsterdam (2000)"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"J.S.B. Mitchell","year":"1999","unstructured":"Mitchell, J.S.B.: Guillotine subdivions approximate polygonal subdivisons: A simple polynomial-time approximation scheme for geometric TSP, k-MST and related problems. SIAM J. Computing\u00a028(4), 1298\u20131309 (1999)","journal-title":"SIAM J. Computing"},{"key":"23_CR12","unstructured":"Mitchell, J.S.B.: A PTAS for TSP with neighborhoods among fat regions in the plane. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (to appear, 2007)"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-52292-1_14","volume-title":"Proc. 15th. Int. Workshop on Graph-theoretic Concepts in Computer Science","author":"G. Reich","year":"1990","unstructured":"Reich, G., Widmayer, P.: Beyond Steiner\u2019s problem: a VLSI oriented generalization. In: Proc. 15th. Int. Workshop on Graph-theoretic Concepts in Computer Science, pp. 196\u2013210. Springer, Heidelberg (1990)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-39658-1_41","volume-title":"Algorithms - ESA 2003","author":"S. Safra","year":"2003","unstructured":"Safra, S., Schwartz, O.: On the complexity of approximating TSP with Neighborhoods and related problems. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 446\u2013458. Springer, Heidelberg (2003)"},{"key":"23_CR15","unstructured":"Slavik, P.: The errand scheduling problem, Tech. report, SUNY, Buffalo, USA (1997)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"van der Stappen, A.F.: Motion planning amidst fat obstacles, Ph.d. dissertation, Utrecht University, Utrecht, the Netherlands (1994)","DOI":"10.1145\/177424.177453"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:48Z","timestamp":1619495388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11940128_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}