Uriel Feige
MohammadTaghi Hajiaghayi
ABSTRACT
We develop the algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces. Unlike in the edge case, we show that embeddings into L1 (and even Euclidean embeddings) are insufficient, but that the additional structure provided by many embedding theorems does suffice for our purposes.We obtain an O(√log n) approximation for min-ratio vertex cuts in general graphs, based on a new semidefinite relaxation of the problem, and a tight analysis of the integrality gap which is shown to be Θ(√log n). We also prove various approximate max-flow/min-vertex-cut theorems, which in particular give a constant-factor approximation for min-ratio vertex cuts in any excluded-minor family of graphs. Previously, this was known only for planar graphs, and for general excluded-minor families the best-known ratio was O(log n).These results have a number of applications. We exhibit an O(√log n) pseudo-approximation for finding balanced vertex separators in general graphs. In fact, we achieve an approximation ratio of O(√log opt) where opt is the size of an optimal separator, improving over the previous best bound of O(log opt). Likewise, we obtain improved approximation ratios for treewidth: In any graph of treewidth k, we show how to find a tree decomposition of width at most O(k √log k), whereas previous algorithms yielded O(k log k). For graphs excluding a fixed graph as a minor (which includes, e.g., bounded genus graphs), we give a constant-factor approximation for the treewidth; this can be used to obtain the first polynomial-time approximation schemes for problems like minimum feedback vertex set and minimum connected dominating set in such graphs.
- N. Alon, P. Seymour, and R. Thomas, A separator theorem for nonplanar graphs, J. Amer. Math. Soc., 3 (1990), pp. 801--808.Google Scholar
Cross Ref
- E. Amir, Efficient approximation for triangulation of minimum treewidth, in Proceedings of the 17th Annual Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, 2001, pp. 7--15. Journal version titled "Approximation Algorithms for Treewidth" is available at the author's homepage. Google ScholarDigital Library
- E. Amir, R. Krauthgamer, and S. Rao, Constant factor approximation of vertex-cuts in planar graphs, in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, ACM Press, 2003, pp. 90--99. Google ScholarDigital Library
- S. Arora, J. R. Lee, and A. Naor, Euclidean distortion and the Sparsest Cut. Manuscript, 2004.Google Scholar
- S. Arora, S. Rao, and U. Vazirani, Expander flows, geometric embeddings, and graph partitionings, in 36th Annual Symposium on the Theory of Computing, 2004. Google ScholarDigital Library
- Y. Aumann and Y. Rabani, An O(log k) approximate min-cut max-flow theorem and approximation algorithm, SIAM J. Comput., 27 (1998), pp. 291--301 (electronic). Google ScholarDigital Library
- S. N. Bhatt and F. T. Leighton, A framework for solving VLSI graph layout problems, J. Comput. System Sci., 28 (1984), pp. 300--343.Google ScholarCross Ref
- H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209 (1998), pp. 1--45. Google ScholarDigital Library
- H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, and T. Kloks, Approximating treewidth, pathwidth, frontsize, and shortest elimination tree, J. Algorithms, 18 (1995), pp. 238--255. Google ScholarDigital Library
- V. Bouchitté, D. Kratsch, H. Müller, and I. Todinca, On treewidth approximations, in Proceedings of the 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, vol. 8 of Electronic Notes in Discrete Mathematics, 2001.Google ScholarCross Ref
- V. Bouchitté and I. Todinca, Treewidth and minimum fill-in: grouping the minimal separators, SIAM J. Comput., 31 (2001), pp. 212--232. Google ScholarDigital Library
- J. Bourgain, On Lipschitz embedding of finite metric spaces in Hilbert space, Israel J. Math., 52 (1985), pp. 46--52.Google ScholarCross Ref
- T. N. Bui and C. Jones, Finding good approximate vertex and edge partitions is np-hard, Inf. Process. Lett., 42 (1992), pp. 153--159. Google ScholarDigital Library
- S. Chawla, A. Gupta, and H. Raecke, Embeddings of negative-type metrics and improved approximations to sparsest cut, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, January 2005. Google ScholarDigital Library
- E. D. Demaine and M. Hajiaghayi, Bidimensionality: New connections between FPT algorithms and PTASs, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, January 2005. Google ScholarDigital Library
- -------------, Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, January 2005. Google ScholarDigital Library
- E. D. Demaine, M. Hajiaghayi, N. Nishimura, P. Ragde, and D. M. Thilikos, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, Journal of Computer and System Sciences, 69 (2004), pp. 166--195. Google ScholarDigital Library
- G. Even, J. Naor, S. Rao, and B. Schieber, Divide-and-conquer approximation algorithms via spreading metrics, J. ACM, 47 (2000), pp. 585--616. Google ScholarDigital Library
- G. Even, J. Naor, B. Schieber, and M. Sudan, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20 (1998), pp. 151--174.Google ScholarCross Ref
- U. Feige, Relations between average case complexity and approximation complexity, in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, ACM Press, 2002, pp. 534--543. Google ScholarDigital Library
- U. Feige and S. Kogan, Hardness of approximation of the balanced complete bipartite subgraph problem, Technical report MCS04-04, Department of Computer Science and Applied Math., The Weizmann Institute of Science, (2004).Google Scholar
- U. Feige and G. Schechtman, On the optimality of the random hyperplane rounding technique for MAX CUT, Random Structures Algorithms, 20 (2002), pp. 403--440. Google ScholarDigital Library
- J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan, A separator theorem for graphs of bounded genus, J. Algorithms, 5 (1984), pp. 391--407. Google ScholarDigital Library
- M. Grohe, Local tree-width, excluded minors, and approximation algorithms, Combinatorica, 23 (2003), pp. 613--632. Google ScholarDigital Library
- L. H. Harper, Optimal numberings and isoperimetric problems on graphs, J. Combinatorial Theory, 1 (1966), pp. 385--393.Google ScholarCross Ref
- J. A. Kelner, Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus, in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, ACM Press, 2004, pp. 455--464. Google ScholarDigital Library
- S. Khot, Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique, in 45th Annual Symposium on Foundations of Computer Science, IEEE Computer Soc., 2004. Google ScholarDigital Library
- S. Khot and N. Vishnoi, On embeddability of negative type metrics into l1. Manuscript, 2004.Google Scholar
- P. N. Klein, S. A. Plotkin, and S. Rao, Excluded minors, network decomposition, and multicommodity flow, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 682--690. Google ScholarDigital Library
- R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor, Measured descent: A new embedding method for finite metrics, in 45th Symposium on Foundations of Computer Science, 2004. Google ScholarDigital Library
- E. L. Lawler, Combinatorial optimization: networks and matroids, Holt, Rinehart and Winston, New York, 1976.Google Scholar
- J. R. Lee, On distance scales, embeddings, and efficient relaxations of the cut cone, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, 2005, ACM. Google ScholarDigital Library
- F. T. Leighton, Complexity Issues in VLSI: Optimal Layout for the Shuffle-Exchange Graph and Other Networks, MIT Press, Cambridge, MA, 1983. Google ScholarDigital Library
- T. Leighton and S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46 (1999), pp. 787--832. Google ScholarDigital Library
- C. Leiserson, Area-efficient graph layouts (for VLSI), in 21th Annual Symposium on Foundations of Computer Science, IEEE Computer Soc., Los Alamitos, CA, 1980, pp. 270--280.Google Scholar
- N. Linial, E. London, and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica, 15 (1995), pp. 215--245.Google ScholarCross Ref
- R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem, SIAM J. Comput., 9 (1980), pp. 615--627.Google ScholarDigital Library
- G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis, Separators for sphere-packings and nearest neighbor graphs, J. ACM, 44 (1997), pp. 1--29. Google ScholarDigital Library
- ------------, Geometric separators for finite-element meshes, SIAM J. Sci. Comput., 19 (1998), pp. 364--386. Google ScholarDigital Library
- Y. Rabinovich, On average distortion of embedding metrics into the line and into L1, in 35th Annual ACM Symposium on Theory of Computing, ACM, 2003. Google ScholarDigital Library
- S. Rao, Small distortion and volume preserving embeddings for planar and Euclidean metrics, in Proceedings of the 15th Annual Symposium on Computational Geometry, New York, 1999, ACM, pp. 300--306. Google ScholarDigital Library
- N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309--322.Google ScholarCross Ref
- N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory Series B, 52 (1991), pp. 153--190. Google ScholarDigital Library
- P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217--241.Google ScholarCross Ref
- D. B. West, Introduction to Graph Theory, Prentice Hall Inc., Upper Saddle River, NJ, 1996.Google Scholar
Index Terms
- Improved approximation algorithms for minimum-weight vertex separators
Recommendations
Improved Approximation Algorithms for Minimum Weight Vertex Separators
We develop the algorithmic theory of vertex separators and its relation to the embeddings of certain metric spaces. Unlike in the edge case, we show that embeddings into $L_1$ (and even Euclidean embeddings) are insufficient but that the additional ...
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
We obtain improved algorithms for finding small vertex covers in bounded degree graphs and hypergraphs. We use semidefinite programming to relax the problems and introduce new} rounding techniques for these relaxations. On graphs with maximum degree at ...
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
We study the problem of finding small s---t separators that induce graphs having certain properties. It is known that finding a minimum clique s---t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221---232, 1985), while for example ...
Comments