Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs
Author:
- Aleksander MadryAMAleksander Madry
- 1 October 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 245-254
Abstract
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees, allows approximating it almost as quickly on general graphs while only losing a poly-logarithmic factor in the approximation guarantee. To illustrate the applicability of our paradigm, we focus our attention on the undirected sparsest cut problem with general demands and the balanced separator problem. By a simple use of our framework, we obtain poly-logarithmic approximation algorithms for these problems that run in time close to linear. The main tool behind our result is an efficient procedure that decomposes general graphs into simpler ones while approximately preserving the cut-flow structure. This decomposition is inspired by the cut-based graph decomposition of R\"acke that was developed in the context of oblivious routing schemes, as well as, by the construction of the ultrasparsifiers due to Spiel man and Teng that was employed to preconditioning symmetric diagonally-dominant matrices.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Breaking the multicommodity flow barrier for o(√log n)-approximations to sparsest cut2009
- On partitioning graphs via single commodity flows2008
- Optimal hierarchical decompositions for congestion minimization in networks2008
- A combinatorial, primal-dual approach to semidefinite programs2007
- Graph partitioning using single commodity flows2006
- Euclidean distortion and the sparsest cut2005
- 0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time2004
- Minimizing congestion in general networks2003
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- Approximating s-t minimum cuts in Õ(n2) time1996