{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T21:15:26Z","timestamp":1770844526284,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671596","type":"print"},{"value":"9783540465218","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_1","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T22:47:16Z","timestamp":1194130036000},"page":"1-16","source":"Crossref","is-referenced-by-count":33,"title":["On Salesmen, Repairmen, Spiders, and Other Traveling Agents"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1051\/ita\/1986200100791","volume":"20","author":"F. Afrati","year":"1986","unstructured":"F. Afrati, S. Cosmadakis, C.H. Papadimitriou, G. Papageorgiou, and N. Papakostantinou. The complexity of the travelling repairman problem. Informatique The\u00f3retique et Applications, 20(1):79\u201387, 1986.","journal-title":"Informatique The\u00f3retique et Applications"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"Ajit Agrawal, Philip Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24(3):440\u2013456, June 1995.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR3","unstructured":"Paola Alimonti and F. Lucidi. On mobile agent planning, 1999. manuscript."},{"key":"1_CR4","unstructured":"Paola Alimonti, F. Lucidi, and S. Triglia. How to move mobile agents, 1999. manuscript."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Arora and Karakostas. Approximation schemes for minimum latency problems. In STOC: ACM Symposium on Theory of Computing (STOC), 1999.","DOI":"10.1145\/301250.301432"},{"issue":"5","key":"1_CR6","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Sanjeev Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753\u2013782, 1998.","journal-title":"Journal of the ACM"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0020-0190(98)00010-6","volume":"65","author":"S. Arya","year":"1998","unstructured":"S. Arya and H. Kumar. A 2.5 approximation algorithm for the k-mst problem. Information Processing Letter, 65:117\u2013118, 1998.","journal-title":"Information Processing Letter"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti=Spaccamela, and Marco Protasi. Complexity and Approximation, Combinatorial optimization problems and their approximability properties. Springer Verlag, 1999.","DOI":"10.1007\/978-3-642-58412-1"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Avrim Blum, Prasad Chalasani, Don Coppersmith, Bill Pulleyblank, Prabhakar Raghavan, and Madhu Sudan. The minimum latency problem. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 163\u2013171, Montr\u00e9al, Qu\u00e9bec, Canada, 23\u201325 May 1994.","DOI":"10.1145\/195058.195125"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Avrim Blum, R. Ravi, and Santosh Vempala. A constant-factor approximation algorithm for the k-MST problem (extended abstract). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 442\u2013448, Philadelphia, Pennsylvania, 22\u201324 May 1996.","DOI":"10.1145\/237814.237992"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Naveen Garg. A 3-approximation for the minimum tree spanning k vertices. In 37th Annual Symposium on Foundations of Computer Science, pages 302\u2013309, Burlington, Vermont, 14\u201316 October 1996. IEEE.","DOI":"10.1109\/SFCS.1996.548489"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296\u2013317, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR13","unstructured":"Michel Goemans and Jon Kleinberg. An improved approximation ratio for the minimum latency problem. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 152\u2013158, New York\/Philadelphia, January 28\u201330 1996. ACM\/SIAM."},{"key":"1_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-61440-0_135","volume-title":"Automata, Languages and Programming, 23rd International Colloquium","author":"E. Koutsoupias","year":"1996","unstructured":"Elias Koutsoupias, Christos H. Papadimitriou, and Mihalis Yannakakis. Searching a fixed graph. In Friedhelm Meyer auf der Heide and Burkhard Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, volume 1099 of Lecture Notes in Computer Science, pages 280\u2013289, Paderborn, Germany, 8\u201312 July 1996. Springer-Verlag."},{"key":"1_CR15","unstructured":"Alberto Marchetti-Spaccamela and Leen Stougie, 1999. private communication."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T04:44:31Z","timestamp":1556945071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}