Extensions and limits to vertex sparsification

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 47-56

  Leighton, F Thomson ^a   Moitra, Ankur ^b  

^a AKAMAI TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

multicommodity flow; oblivious reductions

Indexed keywords

APPROXIMATION RATIOS; BLACK-BOX REDUCTIONS; GRAPH G; LOWER BOUNDS; MINIMUM CUT; MULTICOMMODITY FLOW; SPARSIFICATION;

THEOREM PROVING;

APPROXIMATION ALGORITHMS;

EID: 77954740140     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806698     Document Type: Conference Paper

References (16)

1. M. Adler, N. Harvey, K. Jain, R. Kleinberg, and A. R. Lehman. On the capacity of information networks. Symposium on Discrete Algorithms, pages 320-329, 1990.
2. J. Batson, D. Spielman, and N. Srivastava. Twice-ramanujan sparsifiers. Symposium on Theory of Computing, pages 255-262, 2009.
3. 2) time. Symposium on Theory of Computing, pages 47-55, 1996.
4. A. Bhattacharyya, E. Grigorescu, K. M. Jung, S. Raskhodnikova, and D. Woodruff. Transitive-closure spanners. Symposium on Discrete Algorithms, pages 932-941, 2009.
5. D. Bienstock, E. Brickell, and C. Monma. On the structure of minimum-weight k-connected spanning networks. SIAM Journal on Discrete Mathematics, pages 320-329, 1990.
6. G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. Symposium on Discrete Algorithms, pages 8-16, 2001.
7. Y. H. Chan, W. S. Fung, L. C. Lau, and C. K. Yung. Degree bounded network design with metric costs. Foundations of Computer Science, pages 125-134, 2008.
8. L. P. Chew. There is a planar graph almost as good as the complete graph. Symposium on Computational Geometry, pages 169-177, 1986.
9. J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar. An improved approximation algorithm for the 0-extension problem. Symposium on Discrete Algorithms, pages 257-265, 2003.
10. A. Gupta, V. Nagarajan, and R. Ravi. Improved approximation algorithm for requirement cut. submitted, 2009.
11. N. Harvey, R. Kleinberg, and A. R. Lehman. On the capacity of information networks. IEEE Transactions on Information Theory, pages 251-260, 2006.
12. A. Karzanov. Minimum 0-extensions of graph metrics. European Journal of Combinatorics, pages 71-101, 1998.
13. R. Khandekar, S. Rao, and U. Vazirani. Graph partitioning using single commodity flows. Journal of the ACM, 2009.
14. A. Moitra. Approximation algorithms for multicommodity-type problems with guarantees independent of the graph size. Foundations of Computer Science, pages 3-12, 2009.
15. D. Spielman and N. Srivastava. Graph sparsification by effective resistances. Symposium on Theory of Computing, pages 563-568, 2008.
16. D. Spielman and S. H. Teng. Nearly-linear time algorithms for graph partitioning, sparsification and solving linear systems. Symposium on Theory of Computing, pages 81-90, 2004.