Faster approximation schemes for fractional multicommodity flow-problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 166-173

  Karakostas, George ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION SCHEME; LOGARITHMIC DEPENDENCE; MULTI-COMMODITY FLOW; MULTICOMMODITY FLOW PROBLEMS; RUNNING TIME; TIME INDEPENDENTS;

APPROXIMATION ALGORITHMS;

EID: 84968830840     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. Y. Aumann and Y. Rabani. An 0(logk) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27:1, pp. 291-301, 1998.
3. L. Fleischer. Approximating fractional multicom-modity flow independent of the number of commodities. SIAM Journal on Discrete Mathematics, 13, 2000.
4. L. Fleischer and K.D. Wayne. Fast and simple approximation schemes for generalized flow. In Proceedings 10th ACM/SIAM SODA, pp. 981-982, 1999.
5. N. Garg and J. Konemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings 39th IEEE FOCS, pp. 300-309, November 1998.
6. M. D. Grigoriadis and L. G. Khachiyan. Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization, 4:86-107, 1994.
7. M. D. Grigoriadis and L. G. Khachiyan. Approximate minimum-cost multicommodity flows. Mathematical Programming, 75:477-482, 1996.
8. D. Karger and S. Plotkin. Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. In Proceedings of 27th ACM STOC, pp. 18-25, 1995.
9. 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:466-487, 1994.
10. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation schemes for multicommodity flow problems. JCSS 50:228-243, 1995.
11. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorial, 15:215-246, 1995.
12. S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20:257-301, 1995.
13. T. Radzik. Fast deterministic approximation for the multicommodity flow problem. In Proceedings of the 6th ACM/SIAM SODA, pp. 486-492, 1995.
14. F. Shahrokhi and D.W. Matula. The maximum concurrent flow problem. JACM, 37:318-334, 1990.
15. D. Shmoys. Cut problems and their application to divide-and-conquer, Chapter 5 in D.S. Hockbaum (Ed.) Approximation algorithms for NP-hard problems, PWS Publishing Company, Boston, 1997.
16. N. Young. Randomized routing without solving the linear program. In Proceedings of the 6th ACM/SIAM SODA, pp. 170-178, 1995.