{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:09:58Z","timestamp":1725574198133},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653844"},{"type":"electronic","value":"9783540493822"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-540-49382-2_2","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T04:37:34Z","timestamp":1294461454000},"page":"6-17","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Nili","family":"Guttmann-Beck","sequence":"first","affiliation":[]},{"given":"Refael","family":"Hassin","sequence":"additional","affiliation":[]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Anily, S., Bramel, J., Hertz, A.: A 5\/3 -approximation algorithm for the clustered traveling salesman tour and path problems. Manuscript (December 1997)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0037(199707)29:4<205::AID-NET3>3.0.CO;2-J","volume":"29","author":"E. Arkin","year":"1997","unstructured":"Arkin, E., Hassin, R., Klein, L.: Restricted delivery problems on a network. Networks\u00a029, 205\u2013216 (1997)","journal-title":"Networks"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"J.A. Chisman","year":"1975","unstructured":"Chisman, J.A.: The clustered traveling salesman problem. Computers & Operations Research\u00a02, 115\u2013119 (1975)","journal-title":"Computers & Operations Research"},{"key":"2_CR4","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Operations Research\u00a043, 399\u2013414 (1995)","journal-title":"Operations Research"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"G.N. Frederickson","year":"1979","unstructured":"Frederickson, G.N.: Approximation algorithms for some postman problems. J. Assoc. Comput. Mach.\u00a026, 538\u2013554 (1979)","journal-title":"J. Assoc. Comput. Mach."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput.\u00a07, 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"J.A. Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.A.: Analysis of Christofides\u2019 heuristic: Some paths are more difficult than cycles. Operations Research Letters\u00a010, 291\u2013295 (1991)","journal-title":"Operations Research Letters"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/0305-0548(95)00036-4","volume":"23","author":"M. Gendreau","year":"1996","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: The traveling salesman problem with backhauls. Computers and Operations Research\u00a023, 501\u2013508 (1996)","journal-title":"Computers and Operations Research"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1287\/opre.45.4.639","volume":"45","author":"M. Gendreau","year":"1997","unstructured":"Gendreau, M., Laporte, G., Hertz, A.: An approximation algorithm for the traveling salesman problem with backhauls. Operations Research\u00a045, 639\u2013641 (1997)","journal-title":"Operations Research"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0020-0190(92)90161-N","volume":"41","author":"K. Jansen","year":"1992","unstructured":"Jansen, K.: An approximation algorithm for the general routing problem. Information Processing Letters\u00a041, 333\u2013339 (1992)","journal-title":"Information Processing Letters"},{"key":"2_CR12","first-page":"145","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S., Papadimitriou, C.H.: Performance guarantees for heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pp. 145\u2013180. Wiley, Chichester (1985)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(85)90309-1","volume":"19","author":"K. Jongens","year":"1985","unstructured":"Jongens, K., Volgenant, T.: The symmetric clustered traveling salesman problem. European Journal of Operational Research\u00a019, 68\u201375 (1985)","journal-title":"European Journal of Operational Research"},{"key":"2_CR14","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Reinehart and Winston (1976)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0377-2217(79)90099-7","volume":"3","author":"F.C.J. Lokin","year":"1978","unstructured":"Lokin, F.C.J.: Procedures for traveling salesman problems with additional constraints. European Journal of Operational Research\u00a03, 135\u2013141 (1978)","journal-title":"European Journal of Operational Research"},{"key":"2_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley & Sons, Chichester (1988)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49382-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T21:37:06Z","timestamp":1712093826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}