Improved algorithms for orienteering and related problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 661-670

  Chekuri, Chandra ^a   Korula, Nitish ^a   Pal, Martin ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK DESIGN PROBLEM (NPD); POLYNOMIAL-TIME ALGORITHMS; TOTAL LENGTH;

ALGORITHMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 58649112596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, NJ, 1993
2. E. Arkin, J. Mitchell, and G. Narasimhan. Resourceconstrained geometric network optimization. Proc. of ACM SoCG, 307-316, 1998.
3. S. Arora and G. Karakostas. A 2 +∈ approximation algorithm for the k-mst problem. Proc. of ACM-SIAM SODA, 754-759, 2000.
4. B. Awerbuch, Y. Azar, A. Blum and S. Vempala. New Approximation Guarantees for Minimum Weight k-Trees and Prize-Collecting Salesmen. SIAM J. on Computing, 28(1):254-262, 1999. Preliminary version in Proc. of ACM STOC, 1995.
5. E. Balas. The prize collecting traveling salesman problem. Networks, 19:621-636, 1989.
6. N. Bansal, A. Blum, S. Chawla, and A. Meyerson. Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time-Windows. Proc. of ACM STOC, 166-174, 2004.
7. R. Bar-Yehuda, G. Even and S. Shahar. On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows. J. of Algorithms, 55(1):76-92, 2005.
8. M. Bläser. A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality. Proc. of ACM-SIAM SODA, 638-645, 2002.
9. A. Blum, S. Chawla, D. Karger, T. Lane, A. Meyerson, and M. Minkoff. Approximation Algorithms for Orienteering and Discounted-Reward TSP. SIAM J. on Computing, 37(2):653-670, 2007.
10. A. Blum, R. Ravi and S. Vempala. A Constant-factor Approximation Algorithm for the k-MST Problem. JCSS, 58:101-108, 1999.
11. K. Chaudhuri, B. Godfrey, S. Rao, and K. Taiwan Paths, trees, and minimum latency tours. Proc. of IEEE FOCS, 36-45, 2003.
12. C. Chekuri and N. Korula. Approximation Algorithms for Orienteering with Time Windows. Manuscript, Sept. 2007.
13. C. Chekuri and A. Kumar. Maximum Coverage Problem with Group Budget Constraints and Applications. Proc. of APPROX-RANDOM, LNCS, 72-83, 2004.
14. C. Chekuri and M. Pal. A Recursive Greedy Algorithm for Walks in Directed Graphs. Proc. of IEEE FOCS, 245-253, 2005.
15. C. Chekuri and M. Pal. An O(log n) Approximation for the Asymmetric Traveling Salesman Path Problem. Proc. of APPROX, 95-103, 2005.
16. K. Chen and S. Har-Peled. The Orienteering Problem in the Plane Revisited. Proc. of ACM SoCG, 247-254, 2006.
17. A. Frieze, G. Galbiati and M. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23-39, 1992.
18. N. Garg. Saving an ∈: A 2-approximation for the k-MST problem in graphs. Proc. of ACM STOC, 396-402, 2005.
19. N. Garg. A 3-approximation for the minimum tree spanning k vertices. Proc. of IEEE FOCS, 302-309, 1996.
20. M. Goemans and D. Williamson. A general approximation technique for constrained forest problems. SIAM J. on Computing, 24:296-317, 1995.
21. B. Golden, L. Levy and R. Vohra. The orienteering problem. Naval Research Logistics, 34:307-318, 1987.
22. G. Gutin and A. P. Punnen (Eds.). Traveling Salesman Problem and Its Variations. Springer, Berlin, 2002.
23. H. Kaplan, M. Lewenstein, N. Shafir and M. Sviridenko. Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multidigraphs. Journal of ACM vol. 52, 602-626, 2005.
24. J. Kleinberg and D. Williamson. Unpublished note, 1998.
25. E. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. Shmoys (Eds.). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons Ltd., 1985.
26. V. Nagarajan and R. Ravi. Poly-logarithmic approximation algorithms for Directed Vehicle Routing Problems. Proc. of APPROX, 257-270, 2007.
27. P. Toth and D. Vigo eds. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002.
28. J. Tsitsiklis. Special Cases of Traveling Salesman and Repairman Problems with Time Windows. Networks, vol 22, 263-282, 1992.