Treewidth-Pliability and PTAS for Max-CSPs

We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time approximation scheme (PTAS) for a large class of Max-2-CSPs parametrised by the class of allowed constraint graphs (with arbitrary constraints on an unbounded alphabet). Our result applies more generally to the maximum homomorphism problem between two rational-valued structures. The condition unifies the two main approaches for designing PTASes. One is Baker's layering technique, which applies to sparse graphs such as planar or excluded-minor graphs. The other is based on Szemeredi's regularity lemma and applies to dense graphs. We extend the applicability of both techniques to new classes of Max-CSPs. Treewidth-pliability turns out to be a robust notion that can be defined in several equivalent ways, including characterisations via size, treedepth, or the Hadwiger number. We show connections to the notions of fractional-treewidth-fragility from structural graph theory, hyperfiniteness from the area of property testing, and regularity partitions from the theory of dense graph limits. These may be of independent interest. In particular we show that a monotone class of graphs is hyperfinite if and only if it is fractionally-treewidth-fragile and has bounded degree.

[1]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[2]  E Zigler,et al.  The complexity of complexity. , 1974, Human development.

[3]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[4]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[5]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[7]  David P. Dailey.  Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete , 1980, Discret. Math..

[8]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[9]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Carsten Thomassen.  Girth in graphs , 1983, J. Comb. Theory, Ser. B.

[11]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[12]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[13]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[14]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[15]  Joel H. Spencer,et al.  Counting extensions , 1990, J. Comb. Theory, Ser. A.

[16]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[17]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[18]  Colin McDiarmid,et al.  New upper bounds on harmonious colorings , 1994, J. Graph Theory.

[19]  Marek Karpinski,et al.  Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.

[20]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[21]  Alan M. Frieze,et al.  The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[22]  Wenceslas Fernandez de la Vega,et al.  MAX-CUT has a randomized approximation scheme in dense graphs , 1996, Random Struct. Algorithms.

[23]  Rajeev Motwani,et al.  Towards a syntactic characterization of PTAS , 1996, STOC '96.

[24]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[25]  Harry B. Hunt,et al.  Level-treewidth property, exact algorithms and approximation schemes , 1997, STOC 1997.

[26]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[27]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[28]  Harry B. Hunt,et al.  Towards syntactic characterizations of approximation schemes via predicate and graph decompositions , 1998, FOCS 1998.

[29]  Ran Raz,et al.  PCP characterizations of NP: towards a polynomially-small error-probability , 1999, STOC '99.

[30]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[31]  Venkatesan Guruswami,et al.  On the Hardness of 4-Coloring a 3-Colorable Graph , 2004, SIAM J. Discret. Math..

[32]  Thomas Schwentick,et al.  When is the evaluation of conjunctive queries tractable? , 2001, STOC '01.

[33]  Marek Karpinski,et al.  A Polynomial Time Approximation Scheme for Subdense MAX-CUT , 2002, Electron. Colloquium Comput. Complex..

[34]  Phokion G. Kolaitis,et al.  Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.

[35]  Lars Engebretsen,et al.  Property testers for dense constraint satisfaction programs on finite domains , 2002, Random Struct. Algorithms.

[36]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[37]  Vega W. Fernandez de la,et al.  A Polynomial Time Approximation Scheme for Subdense MAX-CUT , 2002 .

[38]  Martin Grohe.  Local Tree-Width, Excluded Minors, and Approximation Algorithms , 2003, Comb..

[39]  Noga Alon,et al.  Random sampling and approximation of MAX-CSPs , 2003, J. Comput. Syst. Sci..

[40]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[41]  Bruce A. Reed,et al.  Excluding any graph as a minor allows a low tree-width 2-coloring , 2004, J. Comb. Theory, Ser. B.

[42]  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[43]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.

[44]  Erik D. Demaine,et al.  Bidimensionality: new connections between FPT algorithms and PTASs , 2005, SODA '05.

[45]  Yuval Rabani,et al.  Approximation Algorithms for Graph Homomorphism Problems , 2006, APPROX-RANDOM.

[46]  Marek Karpinski,et al.  Approximation Complexity of Nondense Instances of MAX-CUT , 2006, Electron. Colloquium Comput. Complex..

[47]  Jaroslav Nesetril,et al.  Tree-depth, subgraph coloring and homomorphism bounds , 2006, Eur. J. Comb..

[48]  Stephan Kreutzer,et al.  Approximation Schemes for First-Order Definable Optimisation Problems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[49]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[50]  B. Szegedy,et al.  Szemerédi’s Lemma for the Analyst , 2007 .

[51]  Vojtech Rödl,et al.  Regular Partitions of Hypergraphs: Regularity Lemmas , 2007, Combinatorics, Probability and Computing.

[52]  Alexander Grigoriev,et al.  Algorithms for Graphs Embeddable with Few Crossings per Edge , 2005, Algorithmica.

[53]  Artur Czumaj,et al.  Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs , 2009, SIAM J. Comput..

[54]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.

[55]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion II. Algorithmic aspects , 2008, Eur. J. Comb..

[56]  Oded Schramm,et al.  Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..

[57]  Krzysztof Onak,et al.  Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[58]  Mohammad Taghi Hajiaghayi,et al.  Improved Approximation Algorithms for Label Cover Problems , 2011, Algorithmica.

[59]  Christian Sohler,et al.  Every property of hyperfinite graphs is testable , 2011, STOC '11.

[60]  Ran Raz,et al.  PCP characterizations of NP: towards a polynomially-small error-probability , 1999, STOC '99.

[61]  Patrice Ossona de Mendez,et al.  Property Testing, Hyperfiniteness and Separators , 2012 .

[62]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.

[63]  Pasin Manurangsi,et al.  Approximating Dense Max 2-CSPs , 2015, APPROX-RANDOM.

[64]  Asaf Shapira,et al.  Decomposing a graph into expanding subgraphs , 2015, Random Struct. Algorithms.

[65]  Irit Dinur,et al.  Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..

[66]  Zdenek Dvorak,et al.  Sublinear separators, fragility and subexponential expansion , 2014, Eur. J. Comb..

[67]  Stanislav Živný,et al.  The Complexity of Finite-Valued CSPs , 2012, J. ACM.

[68]  Zdenek Dvorak,et al.  Strongly Sublinear Separators and Polynomial Expansion , 2015, SIAM J. Discret. Math..

[69]  Patrice Ossona de Mendez,et al.  On the generalised colouring numbers of graphs that exclude a fixed minor , 2015, Eur. J. Comb..

[70]  Oded Goldreich,et al.  Introduction to Property Testing , 2017 .

[71]  Prasad Raghavendra,et al.  A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.

[72]  Luca Trevisan,et al.  From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[73]  Zdenek Dvorak,et al.  Thin graph classes and polynomial-time approximation schemes , 2017, SODA.

[74]  Zdenek Dvorak,et al.  Treewidth of Grid Subsets , 2018, Comb..

[75]  Pasin Manurangsi,et al.  Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH , 2018, Electron. Colloquium Comput. Complex..

[76]  Stanislav Zivny,et al.  The Complexity of General-Valued CSPs Seen from the Other Side , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[77]  Pasin Manurangsi,et al.  ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network , 2018, ITCS.

[78]  Akash Kumar,et al.  Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs , 2019, STOC.

[79]  Zdenvek Dvovr'ak.  Baker game and polynomial-time approximation schemes , 2019 .

[80]  Jean-Sébastien Sereni,et al.  On Fractional Fragility Rates of Graph Classes , 2019, Electron. J. Comb..

[81]  Saket Saurabh,et al.  Parameterized Complexity and Approximability of Directed Odd Cycle Transversal , 2017, SODA.

[82]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .