Flows on few paths: Algorithms and lower bounds

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

Volumn 3221, Issue , 2004, Pages 520-531

  Martens, Maren ^a   Skutella, Martin ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SHIPS;

APPROXIMATION RESULTS; CONSTANT FACTORS; EDGE-DISJOINT PATHS; NETWORK-FLOW THEORY; PERFORMANCE RATIO; RANDOMIZED ROUNDING; UNSPLITTABLE FLOW; UNSPLITTABLE FLOW PROBLEMS;

CONTAINERS;

EID: 35048867352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_47     Document Type: Article

References (16)

1. Y. Azar and O. Regev. Strongly polynomial algorithms for the unsplittablc flow problem. In Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pages 15-29, 2001.
2. A. Bagchi. Efficient Strategies for Topics in Internet Algorithmics. PhD thesis, The Johns Hopkins University, October 2002.
3. A. Bagchi, A. Chaudary, C. Scheideler, and P. Kolman. Algorithms for faulttolerant routing in circuit switched networks. In Fourteenth ACM Symposium on Parallel Algorithms and Architectures, 2002.
4. G. Baier, E. Köhler, and M. Skutella. On the k-splittable flow problem. Algorithmica. To appear. An extended abstract appeared in Rolf H. Möhring and Rajeev Raman (eds.): Algorithms - ESA '02, Lecture Notes in Computer Science 2461, Springer: Berlin, 2002, 101-113, Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02).
5. A. Baveja and A. Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research, 25, pages 255-280, 2000.
6. C. Chekuri and S. Khanna. Edge disjoint paths revisited. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
7. Y. Dinitz, N. Garg, and M. X. Goemans. On the single source unsplittable flow problem. Combinatorica, 19:17-41, 1999.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
9. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In 'Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 19-28, 1999.
10. J. Kleinberg and R. Rubinfeld. Short paths in expander graphs. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 86-95, 1996.
11. J. M. Kleinberg. Approximation Algorithms for Disjoint Path Problems. PhD thesis, Massachusetts Institute of Technology, May 1996.
12. S. G. Kolliopoulos and C. Stein. Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing, 31:919-946, 2002.
13. P. Kolman and C. Scheideler. Improved bounds for the unsplittable flow problem. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 184-193, 2002.
14. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37, pages 130-143, 1988.
15. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7, pages 365-374, 1987.
16. M. Skutella. Approximating the single source unsplittable min-cost flow problem. Mathematical Programming, 91:493-514, 2002.