On vertex sparsifiers with Steiner nodes

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 673-688

  Chuzhoy, Julia ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

vertex sparsifiers

Indexed keywords

EDGE CAPACITY; EDGE CONGESTION; LOWER BOUNDS; MINIMUM CUT; NON-TERMINAL VERTICES; STEINER VERTICES; UNDIRECTED GRAPH; VERTEX SPARSIFIERS;

ALGORITHMS; COMPUTATION THEORY; FLOW GRAPHS;

GRAPH THEORY;

EID: 84862634867     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214039     Document Type: Conference Paper

References (26)

1. Matthew Andrews. Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 277-286, Washington, DC, USA, 2010. IEEE Computer Society.
2. Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, and Lisa Zhang. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica, 30(5):485-520, 2010.
3. Matthew Andrews and Lisa Zhang. Hardness of the undirected edge-disjoint paths problem. In Harold N. Gabow and Ronald Fagin, editors, STOC, pages 276-283. ACM, 2005.
4. Matthew Andrews and Lisa Zhang. Hardness of the undirected congestion minimization problem. SIAM J. Comput., 37(1):112-131, 2007.
5. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof veri cation and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998. (Pubitemid 128506634)
6. S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122, 1998. (Pubitemid 128615465)
7. Sanjeev Arora, Satish Rao, and Umesh V. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), 2009.
8. Yonatan Aumann and Yuval Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):91-301, 1998.
9. Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. The all-or-nothing multicommodity flow problem. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, STOC '04, pages 156-165, New York, NY, USA, 2004. ACM.
10. Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. Multicommodity flow, well-linked terminals, and routing problems. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 183-192, New York, NY, USA, 2005. ACM.
11. Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. An O(√n) approximation and integrality gap for disjoint paths and unsplittable flow. Theory of Computing, 2(1):137-146, 2006.
12. Julia Chuzhoy. Routing in undirected graphs with constant congestion. In STOC 2012, to appear.
13. Julia Chuzhoy and Joseph (Seffi) Naor. New hardness results for congestion minimization and machine scheduling. J. ACM, 53(5):707-721, 2006.
14. M. Conforti, R. Hassin, and R. Ravi. Reconstructing flow paths. Operations Research Letters, 31:273-276, 2003.
15. David Gale and Lloyd Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 1:9-14, 1962.
16. N. Garg, V.V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)-cut theorems and their applications. SIAM Journal on Computing, 25:235-251, 1995. (Pubitemid 126577270)
17. Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover. In Andrzej Lingas, Rolf G. Karlsson, and Svante Carlsson, editors, ICALP, volume 700 of Lecture Notes in Computer Science, pages 64-75. Springer, 1993.
18. David R. Karger. Random sampling in cut, flow, and network design problems. Mathematics of Operations Research, 24:383-413, 1999.
19. R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
20. F. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46:787-832, 1999.
21. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science, pages 577-591, 1994.
22. Harald Räcke. Minimizing congestion in general networks. In In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 43-52, 2002.
23. Prabhakar Raghavan and Clark D. Tompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, December 1987.
24. Satish Rao and Shuheng Zhou. Edge disjoint paths in moderately connected graphs. SIAM J. Comput., 39(5):1856-1887, 2010.
25. R. Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763-803, 1998. (Pubitemid 128490838)
26. N. Robertson and P. D. Seymour. Outline of a disjoint paths algorithm. In Paths, Flows and VLSI-Layout. Springer-Verlag, 1990.