Flows on few paths: Algorithms and lower bounds

Networks

Volumn 48, Issue 2, 2006, Pages 68-76

  Martens, Maren ^a   Skutella, Martin ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Approximation algorithm; k splittable flow; Multicommodity flow; Network flow; Randomized rounding; Unsplittable flow

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; CONTINUUM MECHANICS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; K-SPLITTABLE FLOW; MULTICOMMODITY FLOW; NETWORK FLOW; RANDOMIZED ROUNDING; UNSPLITTABLE FLOW;

COMPUTER NETWORKS;

EID: 33747850756     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20121     Document Type: Conference Paper

References (21)

1. M. Andrews and L. Zhang, "Hardness of the undirected congestion minimization problem," Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 284-293.
2. Y. Azar and O. Regev, "Strongly polynomial algorithms for the unsplittable flow problem," Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, 2001, pp. 15-29.
3. A. Bagchi, Efficient strategies for topics in internet algorithmics, PhD thesis, The Johns Hopkins University, October 2002.
4. A. Bagchi, A. Chaudary, C. Scheideler, and P. Kolman, "Algorithms for fault-tolerant routing in circuit switched networks," Fourteenth ACM Symposium on Parallel Algorithms and Architectures, 2002.
5. G. Baier, E. Köhler, and M. Skutella, On the k-splittable flow problem, Algorithmica 42 (2005), 231-248.
6. A. Baveja and A. Srinivasan, Approximation algorithms for disjoint paths and related routing and packing problems, Math Oper Res 25 (2000), 255-280.
7. D. Bertsimas and J. Tsitsiklis, Introduction to linear optimization, Athena Scientific, Belmont, MA, 1997.
8. C. Chekuri and S. Khanna, "Edge disjoint paths revisited," Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
9. J. Chuzhoy and J. Naor, "New hardness results for congestion minimization and machine scheduling," Proceedings of the 36th Annual ACM Symposium on Theory of Computing. 2004, pp. 28-34.
10. Y. Dinitz, N. Garg, and M.X. Goemans, On the single source unsplittable flow problem, Combinatorica 19(1999), 17-41.
11. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
12. 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," Proceedings of the 31 st Annual ACM Symposium on Theory of Computing, 1999, pp. 19-28.
13. J. Kleinberg and R. Rubinfeld, "Short paths in expander graphs," Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 86-95.
14. J.M. Kleinberg, Approximation algorithms for disjoint path problems, PhD thesis, Massachusetts Institute of Technology, May 1996.
15. J.M. Kleinberg, "Single-source unsplittable flow," Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 68-77.
16. S.G. Kolliopoulos and C. Stein, Approximation algorithms for single-source unsplittable flow, SIAM J Comput 31 (2002), 919-946.
17. P. Kolman and C. Scheideler, "Improved bounds for the unsplittable flow problem," Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 184-193.
18. T. Leighton, S. Rao, and A. Srinivasan, "Multicommodity flow and circuit switching," Proceedings of the 31st Hawaii International Conference on System Sciences, 1998, pp. 459-465.
19. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J Comput Syst Sci 37 (1988), 130-143.
20. P. Raghavan and C.D. Thompson, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica 7 (1987), 365-374.
21. M. Skutella, Approximating the single source unsplittable min-cost flow problem, Math Program 91 (2002), 493-514.