Strongly polynomial algorithms for the unsplittable flow problem

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

Volumn 2081, Issue , 2001, Pages 15-29

  Azar, Yossi ^a   Regev, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROFITABILITY;

BEST APPROXIMATIONS; BEST-KNOWN ALGORITHMS; CAPACITY CONSTRAINTS; COMBINATORIAL ALGORITHM; EDGE CAPACITY; STRONGLY POLYNOMIAL ALGORITHM; STRONGLY POLYNOMIALS; UNSPLITTABLE FLOW PROBLEMS;

ALGORITHMS;

EID: 84947291208     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45535-3_2     Document Type: Article

References (14)

1. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In 34th IEEE Symposium on Foundations of Computer Science, pages 32-40, 1993.
2. A. Baveja and A. Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. To appear in Mathematics ofOperations Research.
3. A. Borodin and R. El-Yaniv. Online computation and competitive analysis (cam-bridge university press, 1998). SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 29, 1998.
4. S. Fortune, J. Hopcroft, and J. Wyllie. The directed homeomorphism problem. Theoretical Computer Science, 10:111-121, 1980.
5. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. Proc. Of STOC '99, pages 19-28.
6. R.M. Karp. Reducibility among Combinatorial Problems, R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations. Plenum Press, 1972.
7. J. Kleinberg. Approximation Algorithms for Disjoint Paths Problems. PhD thesis, Massachusetts Institue of Technology, 1996.
8. J. Kleinberg. Decision algorithms for unsplittable flow and the half-disjoint paths problem. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC '98), pages 530-539, New York, May 23-26 1998. ACM Press.
9. J. Kleinberg and E. Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. Proc. Of STOC '95, pages 26-35.
10. S. Kolliopoulos and C. Stein. Approximating disjoint-path problems using greedy algorithms and packing integer programs. In IPCO: 6th Integer Programming and Combinatorial Optimization Conference, 1998.
11. P. Raghavan and C.D. Thompson. Provably good routing in graphs: Regular arrays. In Proc. 17th ACM Symp. on Theory of Computing, May 1985.
12. N. Robertson and P. D. Seymour. An outline of a disjoint paths algorithm. In Paths, Flows and VLSI Design, Algorithms and Combinatorics, volume 9, pages 267-292, 1990.
13. N. Robertson and P. D. Seymour. Graph minors. XIII. the disjoint paths problem. JCTB: Journal of Combinatorial Theory, Series B, 63, 1995.
14. A. Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In Proc. 38th IEEE Symp. on Found. of Comp. Science, pages 416-425.