Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 121-130

  Ma̧dry, Aleksander ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

dynamic graph algorithms; multicommodity flow problems

Indexed keywords

APPROXIMATION SCHEME; COMMODITY FLOW; DYNAMIC GRAPH ALGORITHMS; MULTI-COMMODITY FLOW; POLY-LOGARITHMIC FACTORS; RUNNING TIME;

COMPUTATION THEORY;

APPROXIMATION ALGORITHMS;

EID: 77954702543     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806708     Document Type: Conference Paper

References (33)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1993.
2. S. Arora, E. Hazan, and S. Kale. The multiplicative weights update method: A meta-algorithm and applications. Available at http://www.cs.princeton. edu/~arora/pubs/MWsurvey.pdf.
3. G. Ausiello, G. F. Italiano, A. M. Spaccamela, and U. Nanni. On-line computation of minimal and maximal length paths. Theoretical Computer Science, 95(2):245-261, 1992.
4. S. Baswana, R. Hariharan, and S. Sen. Maintaining all-pairs approximate shortest paths under deletion of edges. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 394-403, Philadelphia, PA, USA, 2003. Society for Industrial and Applied Mathematics.
5. S. Baswana, R. Hariharan, and S. Sen. Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. Journal of Algorithms, 62(2):74-92, 2007.
6. D. Bienstock and G. Iyengar. Solving fractional packing problems in Õ(1/ε) iterations. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 146-155, New York, NY, USA, 2004. ACM.
7. 2) barrier. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, page 381, Washington, DC, USA, 2000. IEEE Computer Society.
8. C. Demetrescu and G. F. Italiano. A new approach to dynamic all pairs shortest paths. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 159-166, New York, NY, USA, 2003. ACM.
9. C. Demetrescu and G. F. Italiano. Fully dynamic all pairs shortest paths with real edge weights. Journal of Computer and System Sciences, 72(5):813-837, 2006.
10. S. Even and Y. Shiloach. An on-line edge-deletion problem. Journal of ACM, 28(1):1-4, 1981.
11. L. K. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal of Discrete Mathematics, 13(4):505-520, 2000.
12. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 300-309, 1998.
13. A. V. Goldberg. A natural randomization strategy for multicommodity flow and related algorithms. Information Processing Letters, 42(5):249-256, 1992.
14. A. V. Goldberg and S. Rao. Beyond the flow decomposition barrier. Journal of ACM, 45(5):783-797, 1998.
15. M. D. Grigoriadis and L. G. Khachiyan. Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization, 4(1):86-107, 1994.
16. -2knm) time. Mathematical Programming, 75(3):477-482, 1996.
17. G. Karakostas. Faster approximation schemes for fractional multicommodity flow problems. In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete Algorithms, pages 166-173, Philadelphia, PA, USA, 2002. Society for Industrial and Applied Mathematics.
18. D. Karger and S. Plotkin. Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 18-25, New York, NY, USA, 1995. ACM.
19. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 23(3):466-487, 1994.
20. P. Klein and N. Young. On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms. In In Proceedings of the 7th International IPCO Conference, pages 320-327. Springer, 2002.
21. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50(2):228-243, 1995.
22. A. Madry. Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. arXiv:1003.5907. Available at http://arxiv.org/abs/1003.5907
23. Y. Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 103(1):127-152, 2005.
24. Y. Nesterov. Fast gradient methods for network flow problems. In The 20th International Symposium of Mathematical Programming, 2009.
25. S. A. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257-301, 1995.
26. T. Radzik. Fast deterministic approximation for the multicommodity flow problem. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 486-492, Philadelphia, PA, USA, 1995. Society for Industrial and Applied Mathematics.
27. L. Roditty and U. Zwick. Improved dynamic reachability algorithms for directed graphs. In Proceedings of the 43rd Symposium on Foundations of Computer Science, page 679, Washington, DC, USA, 2002. IEEE Computer Society.
28. L. Roditty and U. Zwick. Dynamic approximate all-pairs shortest paths in undirected graphs. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 499-508, Washington, DC, USA, 2004. IEEE Computer Society.
29. L. Roditty and U. Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 184-191, New York, NY, USA, 2004. ACM.
30. L. Roditty and U. Zwick. On dynamic shortest paths problems. In Proceedings of 12th Annual European Symposium on Algorithms, pages 580-591, 2004.
31. F. Shahrokhi and D. W. Matula. The maximum concurrent flow problem. Journal of ACM, 37(2):318-334, 1990.
32. D. B. Shmoys. Cut problems and their application to divide-and-conquer. pages 192-235, 1997.
33. N. E. Young. Randomized rounding without solving the linear program. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 170-178, Philadelphia, PA, USA, 1995. Society for Industrial and Applied Mathematics.