Abstract
The Traveling Salesman Problem (TSP) is a classical prob- lem in discrete optimization. Its paradigmatic character makes it one of the most studied in computer science and operations research and one for which an impressive amount of algorithms (in particular heuristics and approximation algorithms) have been proposed. While in the general case the problem is known not to allow any constant ratio approximation algorithm and in the metric case no better algorithm than Christofides’ algorithm is known, which guarantees an approximation ratio of 3/2, re- cently an important breakthrough by Arora has led to the definition of a new polynomial approximation scheme for the Euclidean case. A grow- ing attention has also recently been posed on the approximation of other paradigmatic routing problems such as the Travelling Repairman Prob- lem (TRP). The altruistic Travelling Repairman seeks to minimimize the average time incurred by the customers to be served rather than to mini- mize its working time like the egoistic Travelling Salesman does. The new approximation scheme for the Travelling Salesman is also at the basis of a new approximation scheme for the Travelling Repairman problem in the euclidean space. New interesting constant approximation algorithms have recently been presented also for the Travelling Repairman on gen- eral metric spaces. Interesting applications of this line of research can be found in the problem of routing agents over the web. In fact the prob- lem of programming a “spider” for efficiently searching and reporting information is a clear example of potential applications of algorithms for the above mentioned problems. These problems are very close in spirit to the problem of searching an object in a known graph introduced by Koutsoupias, Papadimitriou and Yannakakis [14]. In this paper, moti- vated by web searching applications, we summarize the most important recent results concerning the approximate solution of the TRP and the TSP and their application and extension to web searching problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Afrati, S. Cosmadakis, C.H. Papadimitriou, G. Papageorgiou, and N. Papakostantinou. The complexity of the travelling repairman problem. Informatique Theóretique et Applications, 20(1):79–87, 1986.
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–456, June 1995.
Paola Alimonti and F. Lucidi. On mobile agent planning, 1999. manuscript.
Paola Alimonti, F. Lucidi, and S. Triglia. How to move mobile agents, 1999. manuscript.
Arora and Karakostas. Approximation schemes for minimum latency problems. In STOC: ACM Symposium on Theory of Computing (STOC), 1999.
Sanjeev Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753–782, 1998.
S. Arya and H. Kumar. A 2.5 approximation algorithm for the k-mst problem. Information Processing Letter, 65:117–118, 1998.
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.
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–171, Montréal, Québec, Canada, 23–25 May 1994.
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–448, Philadelphia, Pennsylvania, 22–24 May 1996.
Naveen Garg. A 3-approximation for the minimum tree spanning k vertices. In 37th Annual Symposium on Foundations of Computer Science, pages 302–309, Burlington, Vermont, 14–16 October 1996. IEEE.
M. X. Goemans and D. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296–317, 1995.
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–158, New York/Philadelphia, January 28–30 1996. ACM/SIAM.
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–289, Paderborn, Germany, 8–12 July 1996. Springer-Verlag.
Alberto Marchetti-Spaccamela and Leen Stougie, 1999. private communication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ausiello, G., Leonardi, S., Marchetti-Spaccamela, A. (2000). On Salesmen, Repairmen, Spiders, and Other Traveling Agents. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_1
Download citation
DOI: https://doi.org/10.1007/3-540-46521-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67159-6
Online ISBN: 978-3-540-46521-8
eBook Packages: Springer Book Archive