Improved algorithms for orienteering and related problems

ACM Transactions on Algorithms

Volumn 8, Issue 3, 2012, Pages

  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

Approximation algorithms; K stroll; Orienteering; Orienteering with timewindows

Indexed keywords

EDGE-WEIGHTED GRAPH; K-STROLL; MATHEMATICAL EQUATIONS; NETWORK DESIGN PROBLEMS; OPTIMAL SOLUTIONS; ORIENTEERING; ORIENTEERING PROBLEM; POLYLOGARITHMIC APPROXIMATION; TIME WINDOWS; TOTAL LENGTH; UNDIRECTED GRAPH;

DIRECTED GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 84864832026     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2229163.2229167     Document Type: Article

References (27)

1. AHUJA, R., MAGNANTI, T., AND ORLIN, J. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice- Hall, Upper Saddle River, NJ.
2. ARKIN, E., MITCHELL, J., AND NARASIMHAN, G. 1998. Resource-Constrained geometric nework optimization. In Proceedings of the Symposium on Computational Geometry. 307-316.
3. ARORA, S. AND KARAKOSTAS, G. 2006. A 2+ε approximation algorithm for the k.MST problem. Math. Program. A107, 3, 491-504.
4. AWERBUCH, B., AZAR, Y., BLUM, A., AND VEMPALA, S. 1998. Improved approximation guarantees for minimumweight k-trees and prize-collecting salesmen. SIAM J. Comput. 28, 1, 254-262. (Pubitemid 128491799)
5. BALAS, E. 1989. The prize collecting traveling salesman problem. Netw. 19, 6, 621-636.
6. BANSAL, N., BLUM, A., CHAWLA, S., AND MEYERSON, A. 2004. Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04). 166-174.
7. BAR-YEHUDA, R., EVEN, G., AND SHAHAR, S. 2005. On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algor. 55, 1, 76-92. (Pubitemid 40357146)
8. BLUM, A., CHAWLA, S., KARGER, D., LANE, T., MEYERSON, A., AND MINKOFF, M. 2007. Approximation algorithms for orienteering and discounted-reward TSP. SIAM J. Comput. 37, 2, 653-670. (Pubitemid 351584861)
9. BLUM, A., RAVI, R., AND VEMPALA, S. 1999. A constant-factor approximation algorithm for the k-MST problem. J. Comput. Syst. Sci. 58, 1, 101-108.
10. CHAUDHURI, K., GODFREY, B., RAO, S., AND TALWAR, K. 2003. Paths, trees, and minimum latency tours. In Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS'03). 36-45.
11. CHEKURI, C. AND KORULA, N. 2006. Approximation algorithms for orienteering with time windows. arXiv.org preprint. arXiv:0711.4825v1.
12. CHEKURI, C., KORULA, N., AND PÁL, M. 2008. Improved algorithms for orienteering and related problems. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08). SIAM, Philadelphia, PA, 661-670.
13. CHEKURI, C. AND KUMAR, A. 2004. Maximum coverage problem with group budget constraints and applications. In Proceedings of the APPROX-RANDOM Conference. 72-83.
14. CHEKURI, C. AND P'LAL, M. 2005. A recursive greedy algorithm for walks in directed graphs. In Proceedings of the 46th Annual Symposium on Foundations of Computer Science (FOCS'05). 245-253. (Pubitemid 44375736)
15. CHEKURI, C. AND P'LAL, M. 2007. An O(log n) approximation for the asymmetric traveling salesman path problem. Theory Comput. 3, 197-209.
16. CHEN, K. AND HAR-PELED, S. 2008. The orienteering problem in the plane revisited. SIAM J. Comput. 38, 1, 385-397.
17. FREDERICKSON, G. AND WITTMAN, B. 2007. Approximation algorithms for the traveling repairman and speeding deliveryman problems with unit-time windows. In Proceedings of the APPROX-RANDOM Conference, Lecture Notes in Computer Science, vol. 4627, Springer, 119-133.
18. FRIEZE, A., GALIBIATI, G., AND MAFFIOLI, F. 1982. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Netw. 12, 1, 23-39. (Pubitemid 13492891)
19. GARG, N. 1996. A 3-approximation for the minimum tree spanning k vertices. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS'96). IEEE Computer Society, 302-309.
20. GARG, N. 2005. Saving an epsilon: A 2-approximation for the k-MST problem in graphs. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC'05). ACM Press, New York, 396-402. (Pubitemid 43098610)
21. GOEMANS, M. X. ANDWILLIAMSON, D. 1995. A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296-317.
22. GOLDEN, B., LEVY, L., AND VOHRA, R. 1987. The orienteering problem. Naval Res. Logist. 34, 3, 307-318.
23. GUTIN, G. AND PUNNEN, A., EDS. 2002. The Traveling Salesman Problem and Its Variations. Springer.
24. LAWLER, E., KAN, A. R., LENSTRA, J., AND SHMOYS, D., EDS. 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons.
25. NAGARAJAN, V. AND RAVI, R. 2007. Poly-Logarithmic approximation algorithms for directed vehicle routing problems. In Proceedings of the APPROX-RANDOM Conference. Lecture Notes in Computer Science, vol. 4627, Springer, 257-270.
26. TOTH, P. AND VIGO, D., EDS. 2001. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA.
27. TSITSIKLIS, J. 1992. Special cases of traveling salesman and repairman problems with time windows. Netw. 22, 3, 263-282.