Approximation algorithms for multicommodity-type problems with guarantees independent of the graph size

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 3-12

  Moitra, Ankur ^a  

^a Department of Electrical Engineering and Computer Science   (United States)

Author keywords

Approximation algorithms; Metric geometry; Multicommodity flow

Indexed keywords

FLOW PROBLEMS; FLOW RATIOS; GENERAL THEORY; GRAPH SIZES; LINEAR ARRANGEMENTS; MAXIMUM CONCURRENT FLOW; MIN-CUT; MINIMUM LINEAR ARRANGEMENT; MULTI-COMMODITY; MULTI-COMMODITY FLOW; MULTICUTS; OBLIVIOUS ROUTING; TERMINAL NODES; ZERO-SUM GAME;

COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; COST REDUCTION; FIBER OPTIC CHEMICAL SENSORS;

APPROXIMATION ALGORITHMS;

EID: 77952397389     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.28     Document Type: Conference Paper

References (20)

1. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor, "A general approach to online network optimization problems," Symposium on Discrete Algorithms, pp. 577-586, 2004.
2. S. Arora, J. Lee, and A. Naor, "Euclidean distortion and the sparsest cut," Symposium on Theory of Computing, pp. 553-562, 2005.
3. Y. Aumann and Y Rabani, "An O(log k) approximate min-cut max-flow theorem and approximation algorithm," SIAM Journal on Computing, vol. 27, pp. 291-301, 1998.
4. Y Azar, E. Cohen, A. Fiat, K. Haim, and H. Räcke, "Optimal oblivious routing in polynomial time," Symposium on Theory of Computing, pp. 383-388, 2003.
5. G. Calinescu, H. Karloff, and Y Rabani, "Approximation algorithms for the 0-extension problem," Symposium on Discrete Algorithms, pp. 8-16, 2001.
6. 2 spreading metrics for vertex ordering problems," Symposium on Discrete Algorithms, pp. 1018-1027, 2006.
7. J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar, "An improved approximation algorithm for the 0-extension problem," Symposium on Discrete Algorithms, pp. 257-265, 2003.
8. J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," Symposium on Theory of Computing, pp. 448-455, 2003.
9. N. Garg, V. Vazirani, and M. Yannakakis, "Approximate max-flow min-(multi)cut theorems and their applications," SIAM Journal on Computing, vol. 25, pp. 235-251, 1996.
10. D. Golovin, V. Nagarajan, and M. Singh, "Approximating the k-multicut problem," Symposium on Discrete Algorithms, pp. 621-630, 2006.
11. M. Grötschel, L. Lovász, and A. Schrijver, "Geometric algorithms and combinatorial optimization," Springer Verlag, 1993.
12. C. Harrelson, K. Hildrum, and S. Rao, "A polynomial-time tree decomposition to minimize congestion," Symposium on Parallel Algorithms, pp. 34-43, 2003.
13. A. Karzanov, "Minimum 0-extensions of graph metrics," European Journal of Combinatorics, pp. 71-101, 1998.
14. P. Klein, S. Plotkin, and S. Rao, "Excluded minors, network decomposition, and multicommodity flow," Symposium on Theory of Computing, pp. 682-690, 1993.
15. L. C. Lau, "An approximate max-steiner-tree packing min-steiner-cut theorem," Combinatorica, pp. 71-90, 2007.
16. T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," Journal of the ACM, pp. 787-832, 1999.
17. N. Linial, E. London, and Y Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, vol. 15, pp. 215-245, 1995.
18. V. Nagarajan and R. Ravi, "Approximation algorithms for requirement cut on graphs," International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 209-220, 2005.
19. H. Räcke, "Minimizing congestion in general networks," Foundations of Computer Science, pp. 43-52, 2003.
20. H. Räcke, "Optimal hierarchical decompositions for congestion minimization in networks," Symposium on Theory of Computing, pp. 255-264, 2008.