ABSTRACT
We prove that any graph excluding a fixed minor can have its edges partitioned into a desired number k of color classes such that contracting the edges in any one color class results in a graph of treewidth linear in k. This result is a natural finale to research in contraction decomposition, generalizing previous such decompositions for planar and bounded-genus graphs, and solving the main open problem in this area (posed at SODA 2007). Our decomposition can be computed in polynomial time, resulting in a general framework for approximation algorithms, particularly PTASs (with k ∼ 1/ε), and fixed-parameter algorithms, for problems closed under contractions in graphs excluding a fixed minor. For example, our approximation framework gives the first PTAS for TSP in weighted H-minor-free graphs, solving a decade-old open problem of Grohe; and gives another fixed-parameter algorithm for k-cut in H-minor-free graphs, which was an open problem of Downey et al. even for planar graphs.
To obtain our contraction decompositions, we develop new graph structure theory to realize virtual edges in the clique-sum decomposition by actual paths in the graph, enabling the use of the powerful Robertson--Seymour Graph Minor decomposition theorem in the context of edge contractions (without edge deletions). This requires careful construction of paths to avoid blowup in the number of required paths beyond 3. Along the way, we strengthen and simplify contraction decompositions for bounded-genus graphs, so that the partition is determined by a simple radial ball growth independent of handles, starting from a set of vertices instead of just one, as long as this set is tight in a certain sense. We show that this tightness property holds for a constant number of approximately shortest paths in the surface, introducing several new concepts such as dives and rainbows.
Supplemental Material
- E. Amir. Efficient approximation for triangulation of minimum treewidth. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI-2001), pages 7--15, San Francisco, CA, 2001. Morgan Kaufmann Publishers. Google ScholarDigital Library
- S. Arora, M. Grigni, D. Karger, P. Klein, and A. Woloszyn. A polynomial-time approximation scheme for weighted planar graph TSP. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 33--41, 1998. Google ScholarDigital Library
- S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 222--231, 2004. Google ScholarDigital Library
- B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the Association for Computing Machinery, 41(1):153--180, 1994. Google ScholarDigital Library
- M. Bateni, M. Hajiaghayi, and D. Marx. Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. In Proceedings of the 42nd ACM Symposium on Theory of computing (STOC), pages 211--220. ACM, 2010. Journal version submitted to J. ACM. Google ScholarDigital Library
- M. H. Bateni, M. T. Hajiaghayi, and D. Marx. Prize-collecting network design on planar graphs. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2010. To appear.Google Scholar
- H. L. Bodlaender. Discovering treewidth. In Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science, volume 3381 of Lecture Notes in Computer Science, pages 1-16, Liptovský Ján, Slovakia, January 2005. Google ScholarDigital Library
- G. Borradaile, E. D. Demaine, and S. Tazari. Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, pages 171--182, Freiburg, Germany, February 2009.Google Scholar
- G. Borradaile, C. Kenyon-Mathieu, and P. N. Klein. A polynomial-time approximation scheme for Steiner tree in planar graphs. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007. Google ScholarDigital Library
- E. D. Demaine and M. Hajiaghayi. The bidimensionality theory and its algorithmic applications. The Computer Journal, 51(3):292--302, 2008. Google ScholarDigital Library
- E. D. Demaine, M. Hajiaghayi, and K. ichi Kawarabayashi. Decomposition, approximation, and coloring of odd-minor-free graphs. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 329--344, Austin, Texas, January 2010. Google ScholarDigital Library
- E. D. Demaine, M. Hajiaghayi, and K. Kawarabayashi. Algorithmic graph minor theory: Decomposition, approximation, and coloring. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 637--646, Pittsburgh, PA, October 2005. Google ScholarDigital Library
- E. D. Demaine, M. Hajiaghayi, and B. Mohar. Approximation algorithms via contraction decomposition. Combinatorica. To appear. Previously appeared at SODA 2007. 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(2):166--195, September 2004. Google ScholarDigital Library
- M. DeVos, G. Ding, B. Oporowski, D. P. Sanders, B. Reed, P. Seymour, and D. Vertigan. Excluding any graph as a minor allows a low tree-width 2-coloring. Journal of Combinatorial Theory, Series B, 91(1):25--41, 2004. Google ScholarDigital Library
- F. Dorn, F. Fomin, and D. Thilikos. Catalan structures and dynamic programming in h-minor-free graphs. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 631--640, 2008. Google ScholarDigital Library
- R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto, and F. Rosamond. Cutting up is hard to do: the parameterized complexity of k-cut and related problems. Electr. Notes Theor. Comput. Sci., 78, 2003.Google Scholar
- D. Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27(3-4):275--291, 2000.Google ScholarCross Ref
- U. Feige and J. Kilian. Zero knowledge and the chromatic number. Journal of Computer and System Sciences, 57(2):187--199, 1998. Google ScholarDigital Library
- M. R. Fellows. New directions and new challenges in algorithm design and complexity, parameterized. In Proceedings of the 8th International Workshop on Algorithms and Data Structures, volume 2748 of Lecture Notes in Computer Science, pages 505--520, Ottawa, Ontario, Canada, July-August 2003.Google Scholar
- M. Grigni, E. Koutsoupias, and C. Papadimitriou. An approximation scheme for planar graph TSP. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (Milwaukee, WI, 1995), pages 640--645, Los Alamitos, CA, 1995. Google ScholarDigital Library
- M. Grigni and P. Sissokho. Light spanners and approximate TSP in weighted graphs with forbidden minors. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 852--857, 2002. Google ScholarDigital Library
- M. Grohe. Local tree-width, excluded minors, and approximation algorithms. Combinatorica, 23(4):613--632, 2003. Google ScholarDigital Library
- K.-i. Kawarabayashi and M. Thorup. Minimum k-way cut of bounded size is fixed-parameter tractable. Preprint.Google Scholar
- K.-i. Kawarabayashi and P. Wollan. A simpler algorithm and shorter proof for the graph minor decomposition. In Proceedings of the 43rd ACM Symposium on Theory of Computing, 2010. Google ScholarDigital Library
- P. N. Klein. A linear-time approximation scheme for TSP for planar weighted graphs. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pages 146--155, 2005.Google Scholar
- P. N. Klein. A subset spanner for planar graphs, with application to subset TSP. In Proceedings of the 38th ACM Symposium on Theory of Computing, pages 749--756, 2006. Google ScholarDigital Library
- A. V. Kostochka. Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica, 4(4):307--316, 1984.Google ScholarCross Ref
- T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787--832, 1999. Google ScholarDigital Library
- R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9(3):615--627, 1980.Google ScholarCross Ref
- B. Mohar. Combinatorial local planarity and the width of graph embeddings. Canadian Journal of Mathematics, 44(6):1272--1288, 1992.Google ScholarCross Ref
- N. Robertson and P. D. Seymour. Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory, Series B, 89(1):43--76, 2003. Google ScholarDigital Library
- S. Tazari. Faster approximation schemes and parameterized algorithms on h-minor-free and odd-minor-free graphs. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, volume 6281 of Lecture Notes in Computer Science, pages 641--652, 2010. Google ScholarDigital Library
- A. Thomason. The extremal function for complete minors. Journal of Combinatorial Theory, Series B, 81(2):318--338, 2001. Google ScholarDigital Library
- C. Thomassen. A simpler proof of the excluded minor theorem for higher surfaces. Journal of Combinatorial Theory, Series B, 70:306--311, 1997. Google ScholarDigital Library
- M. Thorup. All structured programs have small tree-width and good register allocation. Information and Computation, 142(2):159--181, 1998. Google ScholarDigital Library
- K. Wagner. Über eine Eigenschaft der eben Komplexe. Mathematische Annalen, 114:570--590, December 1937.Google ScholarCross Ref
Index Terms
- Contraction decomposition in h-minor-free graphs and algorithmic applications
Recommendations
Homomorphisms of triangle-free graphs without a K5-minor
In the course of extending Grotzsch's Theorem, we prove that every triangle-free graph without a K"5-minor is 3-colorable. It has been recently proved that every triangle-free planar graph admits a homomorphism to the Clebsch graph. We also extend this ...
Contraction obstructions for treewidth
We provide two parameterized graphs @C"k, @P"k with the following property: for every positive integer k, there is a constant c"k such that every graph G with treewidth at least c"k, contains one of K"k, @C"k, @P"k as a contraction, where K"k is a ...
On graph contractions and induced minors
The Induced Minor Containment problem takes as input two graphs G and H, and asks whether G has H as an induced minor. We show that this problem is fixed parameter tractable in |V"H| if G belongs to any nontrivial minor-closed graph class and H is a ...
Comments