{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:54Z","timestamp":1725470754133},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_7","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T09:20:54Z","timestamp":1157966454000},"page":"40-51","source":"Crossref","is-referenced-by-count":3,"title":["Cooperative TSP"],"prefix":"10.1007","author":[{"given":"Amitai","family":"Armon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adi","family":"Avidor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Arkin, E.M., Bender, M.A., Fekete, S.P., Mitchell, J.S.B., Skutella, M.: The Freeze-Tag Problem: How to Wake Up a Swarm of Robots. In: Proc. of SODA 2002, pp. 568\u2013577 (2002)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Bender, M.A., Ge, D., He, S., Mitchell, J.S.B.: Improved Approximation Algorithms or the Freeze-Tag Problem. In: SPAA 2003, pp. 295\u2013303 (2003)","DOI":"10.1145\/777412.777465"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00453-004-1103-4","volume":"40","author":"S. Arora","year":"2004","unstructured":"Arora, S., Chang, K.L.: Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems. Algorithmica\u00a040(3), 189\u2013210 (2004)","journal-title":"Algorithmica"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"E. Arkin","year":"1994","unstructured":"Arkin, E., Hassin, R.: Approximation Algorithms for the Geometric Covering Salesman Problem. Discrete Applied Math.\u00a055, 197\u2013218 (1994)","journal-title":"Discrete Applied Math."},{"issue":"5","key":"7_CR5","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 TSP and other Geometric Problems. Journal of the ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"Journal of the ACM"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Multicasting in Heterogeneous Networks. In: Proc. of STOC 1998, pp. 448\u2013453 (1998)","DOI":"10.1145\/276698.276857"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Euclidean Bounded-Degree Spanning Tree Ratios. In: Proc. 19th ACM SoCG, pp. 11\u201319 (2003)","DOI":"10.1145\/777792.777795"},{"key":"7_CR8","unstructured":"Christofides, N.: Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem. Technical report, Graduate School of Industrial Administration, Carnegy\u2013Mellon University (1976)"},{"key":"7_CR9","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. Journal of Algorithms\u00a057, 22\u201336 (2005)","journal-title":"Journal of Algorithms"},{"key":"7_CR10","unstructured":"Dumitrescu, A., Mitchell, J.S.B.: Approximation Algorithms for TSP with Neighborhoods in the Plane. In: Proc. of SODA 2001, pp. 38\u201346 (2001)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-48224-5_17","volume-title":"Automata, Languages and Programming","author":"L. Engebretsen","year":"2001","unstructured":"Engebretsen, L., Karpinski, M.: Approximation Hardness of TSP with Bounded Metrics. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 201\u2013212. Springer, Heidelberg (2001)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1006\/jagm.1997.0862","volume":"24","author":"S.P. Fekete","year":"1997","unstructured":"Fekete, S.P., Khuller, S., Klemmstein, M., Raghavachari, B., Young, N.: A Network Flow Technique for Finding Low-Weight Bounded-Degree Trees. Journal of Algorithms\u00a024, 310\u2013324 (1997)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks\u00a018(4), 319\u2013359 (1988)","journal-title":"Networks"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00453-004-1121-2","volume":"41","author":"J. K\u00f6nemann","year":"2004","unstructured":"K\u00f6nemann, J., Levin, A., Sinha, A.: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica\u00a041(2), 117\u2013129 (2004)","journal-title":"Algorithmica"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/S0097539794264585","volume":"25","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Low Degree Spanning Trees of Small Weight. SIAM Journal of Computing\u00a025(2), 355\u2013368 (1996)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"7_CR16","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 Subdivisions Approximate Polygonal Subdivisions: Part II \u2013 A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal of Computing\u00a028(4), 1298\u20131309 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"7_CR17","unstructured":"Mitchell, J.S.B.: A PTAS for TSP with Neighborhoods Among Fat Regions in the Plane. Private communication (2006)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Mata, C., Mitchell, J.S.B.: Approximation Algorithms for Geometric Tour and Network Design Problems. In: SCG 1995, pp. 360\u2013369 (1995)","DOI":"10.1145\/220279.220318"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On Two Geometric Problems Related to the Traveling Salesman Problem. J. of Alg.\u00a05, 231\u2013246 (1984)","journal-title":"J. of Alg."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Ravi, R.: Rapid Rumor Ramification: Approximating the Minimum Broadcast Time. In: Proc. of FOCS 1994, pp. 202\u2013213 (1994)","DOI":"10.1109\/SFCS.1994.365693"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-45471-3_28","volume-title":"Algorithm Theory - SWAT 2002","author":"M.O. Sztainberg","year":"2002","unstructured":"Sztainberg, M.O., Arkin, E.M., Bender, M.A., Mitchell, J.S.B.: Analysis of Heuristics for the Freeze-Tag Problem. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 270\u2013279. Springer, Heidelberg (2002)"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00037-005-0200-3","volume":"14","author":"S. Safra","year":"2005","unstructured":"Safra, S., Schwartz, O.: On the Complexity of Approximating TSP with Neighborhoods and Related Problems. Computational Complexity\u00a014, 281\u2013307 (2005)","journal-title":"Computational Complexity"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:40:39Z","timestamp":1605624039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11841036_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}