Dial a ride from k-forest

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 241-252

  Gupta, Anupam ^a   Hajiaghayi, Mohammad Taghi ^a   Nagarajan, Viswanath ^a   Ravi, R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

DENSE K SUBGRAPH PROBLEMS; K FOREST PROBLEM; NON DECREASING FUNCTION;

GRAPH THEORY;

EID: 38049070388     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_23     Document Type: Conference Paper

References (21)

1. Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized steiner problem on networks. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 134-144. ACM Press, New York (1991)
2. Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time Windows. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 166-174. ACM Press, New York (2004)
3. Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation Algorithms for Orienteering and Discounted-Reward TSP. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 46-55. IEEE Computer Society Press, Los Alamitos (2003)
4. Charikar, M., Chekuri, C., yat Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. In: SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pp. 192-200. ACM Press, New York (1998)
5. Charikar, M., Raghavachari, B.: The Finite Capacity Dial-A-Ride Problem. In: IEEE Symposium on Foundations of Computer Science, pp. 458-467. IEEE Computer Society Press, Los Alamitos (1998)
6. Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees, and minimum latency tours. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 36-45 (2003)
7. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. GSIA, CMU-Report 388 (1977)
8. Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. In: Proceedings of the 14th annual ACM-SIAM symposium on Discrete algorithms, pp. 655-664. ACM Press, New York (2003)
9. Feige, U., Peleg, D., Kortsarz, G.: The Dense k -Subgraph Problem. Algorithmica 29(3), 410-421 (2001)
10. Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM Journal on Computing 7(2), 178-193 (1978)
11. Garg, N.: Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In: Proceedings of the thirty-seventh annual. ACM symposium on Theory of computing, pp. 396-402. ACM Press, New York (2005)
12. Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 307-316. ACM Press, New York (1992)
13. Gupta, A., Hajiaghayi, M.T., Nagarajan, V., Ravi, R.: Dial a Ride from k-forest (2007), http://arxiv.org/abs/0707.0648
14. Haimovich, M., Rinnooy Kan, A.H.G.: Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research 10, 527-542 (1985)
15. Hajiaghayi, M.T., Jain, K.: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. In: SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 631-640. ACM Press, New York (2006)
16. Krumke, S., Rambau, J., Weider, S.: An approximation algorithm for the nonpre-emptive capacitated dial-a-ride problem. Preprint 00-53, Konrad-Zuse-Zentrum fr Informationstechnik Berlin (2000)
17. Robins, G., Zelikovsky, A.: Tighter Bounds for Graph Steiner Tree Approximation. SIAM Journal on Discrete Mathematics 19, 122-134 (2005)
18. Gørtz, I.L.: Hardness of Preemptive Finite Capacity Dial-a-Ride. In: 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (2006)
19. Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transportation Science 29, 17-29 (1995)
20. Segev, D., Segev, G.: Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. In: 14th Annual European Symposium on Algorithms, pp. 600-611 (2006)
21. Steele, J.M.: Variations on the monotone subsequence theme of Erdös and Szekeres. In: Discrete probability and algorithms (Minneapolis, MN, 1993). IMA Math. Appl., vol. 72, pp. 111-131. Springer, New York (1995)