Access the full text.
Sign up today, get DeepDyve free for 14 days.
[ (2001)
When is the evaluation of conjunctive queries tractable? In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC’01)ACM
Zdenek Dvorák (2019)
Baker game and polynomial-time approximation schemes
H. Hunt, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, R. Stearns (1998)
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsJ. Algorithms, 26
S. Khanna, M. Sudan, L. Trevisan, David Williamson (2001)
The Approximability of Constraint Satisfaction ProblemsSIAM J. Comput., 30
Matt DeVos, G. Ding, Bogdan Oporowski, Daniel Sanders, B. Reed, P. Seymour, D. Vertigan (2004)
Excluding any graph as a minor allows a low tree-width 2-coloringJ. Comb. Theory, Ser. B, 91
S. Khanna, R. Motwani (1996)
Towards a syntactic characterization of PTAS
Martin Grohe, V. Guruswami, Stanislav Živný (2018)
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231)Dagstuhl Reports, 12
P. Jeavons, A. Krokhin, Stanislav Živný (2014)
The Complexity of Valued Constraint SatisfactionBull. EATCS, 113
[ (2020)
Treewidth-Pliability and PTAS for Max-CSPsTechnical Report. arXiv:1911.03204.
M. Romero, Marcin Wrochna, Stanislav Živný (2019)
Pliability and Approximating Max-CSPsJournal of the ACM
Akbar Rafiey, A. Rafiey, Thiago Santos (2019)
Toward a Dichotomy for Approximation of $H$-coloring
M. Kozik, Joanna Ochremiak (2014)
Algebraic Properties of Valued Constraint Satisfaction Problem
[ (2007)
Linear degree extractors and the inapproximability of max clique and chromatic numberTheory Comput., 3
(1980)
. Krokhin and Stanislav Živný ( Eds . ) . Dagstuhl Follow - Ups , Vol . 7
[ (2021)
Personal communication, 1
H. Bodlaender (1998)
A Partial k-Arboretum of Graphs with Bounded TreewidthTheor. Comput. Sci., 209
B. Baker (1983)
Approximation algorithms for NP-complete problems on planar graphs24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
H. Sherali, Warren Adams (1990)
A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming ProblemsSIAM J. Discret. Math., 3
P. Hell, A. Rafiey (2012)
The Dichotomy of Minimum Cost Homomorphism Problems for DigraphsSIAM J. Discret. Math., 26
[ (2003)
Local tree-width, excluded minors, and approximation algorithmsCombinatorica, 23
B. Reed (2003)
Algorithmic Aspects of Tree Width
Martin Grohe (2000)
Local Tree-Width, Excluded Minors, and Approximation AlgorithmsCombinatorica, 23
R. Briceño, A. Bulatov, V. Dalmau, B. Larose (2019)
Dismantlability, Connectedness, and Mixing in Relational StructuresJ. Comb. Theory, Ser. B, 147
P. Jonsson, Gustav Nordh (2007)
Introduction to the Maximum Solution Problem
Clément Carbonnel, M. Romero, Stanislav Živný (2017)
The Complexity of General-Valued CSPs Seen from the Other Side2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
P. Berman, Marek Karpinski (1999)
On Some Tighter Inapproximability Results (Extended Abstract)
[ (2007)
The complexity of homomorphism and constraint satisfaction problems seen from the other sideJ. ACM, 54
[ (1994)
Approximation algorithms for NP-complete problems on planar graphsJ. ACM, 41
[ (2021)
Treewidth-pliability and PTAS for Max-CSPsProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’21). SIAM
P. Jonsson, Fredrik Kuivinen, Gustav Nordh (2008)
MAX ONES Generalized to Larger DomainsSIAM J. Comput., 38
Peter Fulla, Hannes Uppman, Stanislav Živný (2017)
The Complexity of Boolean Surjective General-Valued CSPsACM Transactions on Computation Theory (TOCT), 11
P. Jonsson, A. Krokhin, Fredrik Kuivinen (2007)
Hard constraint satisfaction problems have hard gaps at location 1ArXiv, abs/0712.1532
[ (2005)
Algorithmic graph minor theory: Decomposition, approximation, and coloringProceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05). IEEE Computer Society
[ (2008)
Optimal algorithms and inapproximability results for every CSP? In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC’08)ACM
Zdenek Dvorák (2014)
Sublinear separators, fragility and subexponential expansionEur. J. Comb., 52
E. Demaine, M. Hajiaghayi, K. Kawarabayashi (2005)
Algorithmic graph minor theory: Decomposition, approximation, and coloring46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
[ (2010)
Graph Theory (4th edSpringer.
Zdenek Dvorák, Jean-Sébastien Sereni (2019)
On Fractional Fragility Rates of Graph ClassesElectron. J. Comb., 27
B. Reed, Cláudia Linhares-Sales (2003)
Recent advances in algorithms and combinatorics
Subhash Khot (2002)
On the power of unique 2-prover 1-round gamesProceedings 17th IEEE Annual Conference on Computational Complexity
G. Brightwell, P. Winkler (2000)
Gibbs Measures and Dismantlable GraphsJ. Comb. Theory, Ser. B, 78
H. Bodlaender (1993)
A linear time algorithm for finding tree-decompositions of small treewidthProceedings of the twenty-fifth annual ACM symposium on Theory of Computing
Martin Cooper, Stanislav Živný (2017)
Hybrid Tractable Classes of Constraint Problems
P. Hell, M. Mastrolilli, M. Nevisi, A. Rafiey (2012)
Approximation of Minimum Cost Homomorphisms
M. Marathe, H. Hunt, R. Stearns (1997)
Level-treewidth property, exact algorithms and approximation schemes
Balázs Mezei, Marcin Wrochna, Stanislav Živný (2020)
PTAS for Sparse General-Valued CSPs2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
[ (2022)
The complexity of general-valued constraint satisfaction problems seen from the other sideSIAM J. Comput., 51
A. Grigoriev, H. Bodlaender (2005)
Algorithms for Graphs Embeddable with Few Crossings per EdgeAlgorithmica, 49
M. Bugliesi, Silvia Crafa, Massimo Merro, V. Sassone (2005)
Communication and mobility control in boxed ambientsInf. Comput., 202
David Dailey (1980)
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-completeDiscret. Math., 30
Rustem Takhanov (2007)
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
P. Raghavendra (2008)
Optimal algorithms and inapproximability results for every CSP?Proceedings of the fortieth annual ACM symposium on Theory of computing
K. Makarychev, Yury Makarychev (2017)
Approximation Algorithms for CSPs
V. Kolmogorov, A. Krokhin, Michal Rolinek (2015)
The Complexity of General-Valued CSPs2015 IEEE 56th Annual Symposium on Foundations of Computer Science
G. Gutin, P. Hell, A. Rafiey, Anders Yeo (2008)
A dichotomy for minimum cost graph homomorphismsEur. J. Comb., 29
(2005)
Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER
Martin Grohe (2003)
The complexity of homomorphism and constraint satisfaction problems seen from the other side44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
Martin Grohe, T. Schwentick, L. Segoufin (2001)
When is the evaluation of conjunctive queries tractable?
Amit Kumar, R. Manokaran, Madhur Tulsiani, Nisheeth Vishnoi (2011)
On LP-based approximability for strict CSPs
[ (2002)
On the power of unique 2-prover 1-round gamesProceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC’02). ACM
A. Bulatov, A. Krokhin, B. Larose (2008)
Dualities for Constraint Satisfaction Problems
[ (2017)
The complexity of general-valued CSPsSIAM J. Comput., 46
We study polynomial-time approximation schemes (PTASes) for constraint satisfaction problems (CSPs) such as Maximum Independent Set or Minimum Vertex Cover on sparse graph classes. Baker’s approach gives a PTAS on planar graphs, excluded-minor classes, and beyond. For Max-CSPs, and even more generally, maximisation finite-valued CSPs (where constraints are arbitrary non-negative functions), Romero, Wrochna, and Živný [SODA’21] showed that the Sherali-Adams LP relaxation gives a simple PTAS for all fractionally-treewidth-fragile classes, which is the most general “sparsity” condition for which a PTAS is known. We extend these results to general-valued CSPs, which include “crisp” (or “strict”) constraints that have to be satisfied by every feasible assignment. The only condition on the crisp constraints is that their domain contains an element that is at least as feasible as all the others (but possibly less valuable).For minimisation general-valued CSPs with crisp constraints, we present a PTAS for all Baker graph classes—a definition by Dvořák [SODA’20] that encompasses all classes where Baker’s technique is known to work, except for fractionally-treewidth-fragile classes. While this is standard for problems satisfying a certain monotonicity condition on crisp constraints, we show this can be relaxed to diagonalisability—a property of relational structures connected to logics, statistical physics, and random CSPs.
ACM Transactions on Algorithms (TALG) – Association for Computing Machinery
Published: Mar 9, 2023
Keywords: Constraint satisfaction
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.