Approximation algorithms for the unsplittable flow problem

Algorithmica (New York)

Volumn 47, Issue 1, 2007, Pages 53-78

  Chakrabarti, Amit ^a   Chekuri, Chandra ^b   Gupta, Anupam ^c   Kumar, Amit ^d  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Carnegie Mellon University   (United States)

^d INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Alteration; Approximation algorithms; Disjoint paths; Expanders; Line networks; Randomized rounding; Ring network; Unsplittable flow problem

Indexed keywords

CONSTANT FACTOR APPROXIMATION ALGORITHMS; DISJOINT PATHS; LINE NETWORKS; RANDOMIZED ROUNDING; RING NETWORKS; UNSPLITTABLE FLOW PROBLEM (UFP);

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY;

PROBLEM SOLVING;

EID: 33846875601     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-1210-5     Document Type: Article

References (44)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows. Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. Noga Alon and Joel Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992.
3. Matthew Andrews and Lisa Zhang. Hardness of the undirected edge-disjoint paths problem. In Proceedings of the 37th Annual ACM Syposium on Theory of Computing, pages 276-283, 2005.
4. Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, and Lisa Zhang. Hardness of the undirected edge-disjoint paths problem with congestion. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 226-244, 2005.
5. Baruch Awerbuch, Yossi Azar, and Serge Plotkin. Throughput-competitive online routing. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 32-40, 1993.
6. Yossi Azar and Oded Regev. Strongly polynomial algorithms for the unsplittable flow problem. In Proceedings of the 8th Integer Programming and Combinatorial Optimization Conference, pages 15-29, 2001.
7. Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph (Seffi) Naor, and Baruch Schieber. A unified approach to approximating resource allocation and scheduling. J. ACM, 48(5):1069-1090, 2001.
8. Preliminary version in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 735-744, 2000.
9. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, and Baruch Schieber. Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput., 31(2):331-352, 2001.
10. Alok Baveja and Aravind Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. Math. Oper. Res., 25(2):255-280, 2000.
11. Piotr Berman and Bhaskar DasGupta. Improvements in throughout maximization for real-time scheduling. In Proceedings of the 32nd Annual ACM symposium on Theory of Computing, pages 680-687. ACM Press, New York, 2000.
12. Tom Bohman and Alan Frieze. Arc-disjoint paths in expander digraphs. SIAM J. Comput., 32(2):326-344, 2003.
13. Andrei Z. Broder, Alan M. Frieze, and Eli Upfal. Existence and construction of edge-disjoint paths on expander graphs. SIAM J. Comput., 23(5):976-989, 1994.
14. Gruia Calinescu, Amit Chakrabarti, Howard Karloff, and Yuval Rabani. Improved approximation algorithms for resource allocation. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference, pages 439-456. Volume 2337 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
15. Chandra Chekuri and Sanjeev Khanna. Edge disjoint paths revisited. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), pages 628-637. ACM Press, New York, 2003.
16. Chandra Chekuri, Marcelo Mydlarz, and F. Bruce Shepherd. Multicommodity demand flow in a tree (extended abstract). In Automata, Languages and Programming, pages 410-425. Volume 2719 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2003.
17. Lisa K. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math., 13(4):505-520, 2000.
18. Alan M. Frieze. Edge-disjoint paths on expander graphs. SIAM J. Comput., 30(6):1790-1801, 2001.
19. Naveen Garg and Jochen Konemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300-309, 1998.
20. Naveen Garg, Vijay Vazirani, and Mihalis Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18(1):3-20, 1997.
21. Preliminary version in Proceedings of the 20th International Colloquium on Automata, Languages, and Programming, pages 64-75, 1993.
22. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, Bruce Shepherd, and Mihalis Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. System Sci., 67(3):473-496, 2003.
23. Preliminary version in Proceedings of 31st ACM Symposium on Theory of Computing, pages 19-28, 1999.
24. Jon M. Kleinberg. Approximation Algorithms for Disjoint Paths Problems. Ph.D. thesis, MIT, 1996.
25. Jon M. Kleinberg and Ronitt Rubinfeld. Short paths in expander graphs. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 86-95, 1996.
26. Stavros Kolliopoulos and Cliff Stein. Approximating disjoint-path problems using packing integer programs. Math. Programm. Ser. A, 99(1):63-87, 2004.
27. Preliminary version in Proceedings of IPCO, pages 153-168, 1998.
28. Petr Kolman and Christian Scheideler. Simple on-line algorithms for the maximum disjoint paths problem. Algorithmica, 39(3):209-233, 2004.
29. Preliminary version in Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures, pages 38-47, 2001.
30. Petr Kolman and Christian Scheideler. Improved bounds for the unsplittable flow problem. To appear in J. Algorithms.
31. Preliminary version in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 184-193, 2002.
32. F. Thomas Leighton and Satish B. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
33. Preliminary version in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422-431, 1988.
34. Alex Lubotzky, Ralph Philips, and Peter Sarnak. Ramanujan graphs. Combinatorica, 8:261-277, 1988.
35. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
36. Cynthia A. Phillips, R. N. Uma, and Joel Wein. Off-line admission control for general scheduling problems. J. Sched., 3(6):365-381, 2000.
37. Preliminary version in Proceedings of 11th SODA, pages 879-888, 2000.
38. Serge A. Plotkin, David B. Shmoys, and Éva Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res., 20(2):257-301, 1995.
39. Prabhakar Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci., 37(2): 130-143, 1988.
40. Preliminary version in Proceedings of FOCS, pages 10-18, 1986.
41. Alexander Schrijver. Theory of Linear and Integer Programming. Wiley, New York, 1986.
42. Aravind Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 416-425, 1997.
43. Aravind Srinivasan. New approaches to covering and packing problems. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 567-576, 2001.
44. Kasturi Varadarajan and Ganesh Venkataraman. Graph decomposition and the Greedy algorithm for edge-disjoint paths. Proceedings of SODA, pages 379-380, 2004.