Author:
Ausiello Giorgio,Leonardi Stefano,Marchetti-Spaccamela Alberto
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. 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.
2. 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.
3. Paola Alimonti and F. Lucidi. On mobile agent planning, 1999. manuscript.
4. Paola Alimonti, F. Lucidi, and S. Triglia. How to move mobile agents, 1999. manuscript.
5. Arora and Karakostas. Approximation schemes for minimum latency problems. In STOC: ACM Symposium on Theory of Computing (STOC), 1999.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Better-Than-1.6-Approximation for Prize-Collecting TSP;Lecture Notes in Computer Science;2024
2. TSP review: performance comparison of the well-known methods on a standardized dataset;2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS);2023-08-14
3. An Improved Approximation Guarantee for Prize-Collecting TSP;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Online routing and searching on graphs with blocked edges;Journal of Combinatorial Optimization;2022-06-22
5. Solving the traveling delivery person problem with limited computational time;Central European Journal of Operations Research;2022-01-20