Approximation algorithms for the unsplittable flow problem

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

Volumn 2462, Issue , 2002, Pages 51-67

  Chakrabarti, Amit ^a   Chekuri, Chandra ^b   Gupta, Anuptam ^b   Kumar, Amit ^c  

^a Princeton University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; FLOW GRAPHS;

APPROXIMATION RATIOS; BEST-KNOWN ALGORITHMS; CONSTANT DEGREE; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; MAXIMUM DEMAND; RANDOMIZED ROUNDING; UNDIRECTED GRAPH; UNSPLITTABLE FLOW PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 84957021733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45753-4_7     Document Type: Conference Paper

References (21)

1. N. Alon and J. Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992.
2. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 32–40. 1993.
3. Y. Azar and O. Regev. Strongly polynomial algorithms for the unsplittable flow problem. In Proceedings of the 8th Integer Programming and Combinatorial Optimization Conference. 2001.
4. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. S. Naor, and B. Scheiber. A unified approach to approximating resource allocation and scheduling. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 735–744, 2000.
5. A. Baveja and A. Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. Math. Oper. Res., 25(2):255–280, 2000.
6. P. Berman and B. DasGupta. Improvements in throughput maximization for realtime scheduling. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 680–687, 2000.
7. T. Bohman and A. M. Frieze. Arc-disjoint paths in expander digraphs. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science. 2001.
8. A. Z. Broder, A. M. Frieze, and E. Upfal. Existence and construction of edgedisjoint paths on expander graphs. SIAM Journal on Computing, 23(5):976–989, 1994.
9. G. Calinescu, A. Chakrabarti, H. Karloff, and Y. Rabani. Improved approximation algorithms for resource allocation. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference, 2002.
10. A. M. Frieze. Edge-disjoint paths on expander graphs. SIAM Journal on Computing, 30(6):1790–1801, 2001.
11. V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 19–28. 1999.
12. J. M. Kleinberg. Approximation Algorithms for Disjoint Paths Problems. Ph.D. thesis, MIT, 1996.
13. J. M. Kleinberg and R. Rubinfeld. Short paths in expander graphs. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pp. 86–95. 1996.
14. P. Kolman and S. Scheideler. Simple on-line algorithms for the maximum disjoint paths problem. In Proceedings of 13th ACM Symposium on Parallel Algorithms and Architectures. 2001.
15. P. Kolman and S. Scheideler. Improved bounds for the unsplittable flow problem. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 2002.
16. F. T. Leighton and S. B. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787–832, 1999. (Preliminary version in 29th Annual Symposium on Foundations of Computer Science, pages 422–431, 1988).
17. C. A. Phillips, R. N. Uma, and J. Wein. Off-line admission control for general scheduling problems. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 879–888. 2000.
18. P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365–374, 1987.
19. A. 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, pp. 416–425. 1997.
20. A. Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput., 29(2):648–670, 1999.
21. A. Srinivasan. New approaches to covering and packing problems. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 567–576. 2001.