research-article

Robust satisfiability of constraint satisfaction problems

Authors:

Marcin KozikAuthors Info & Claims

STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Pages 931 - 940

https://doi.org/10.1145/2213977.2214061

Published: 19 May 2012 Publication History

Abstract

An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least (1-g(ε))-fraction of the constraints given a (1-ε)-satisfiable instance, where g(ε) -> 0 as ε -> 0, $g(0)=0. Guruswami and Zhou conjectured a characterization of constraint languages for which the corresponding constraint satisfaction problem admits an efficient robust algorithm. This paper confirms their conjecture.

Supplementary Material

JPG File (stoc_11a_4.jpg)

Download
9.93 KB

MP4 File (stoc_11a_4.mp4)

Download
140.56 MB

References

[1]

L. Barto and M. Kozik. Constraint satisfaction problems of bounded width. In FOCS'09: Proceedings of the 50th Symposium on Foundations of Computer Science, pages 595--603, 2009.

Digital Library

[2]

L. Barto and M. Kozik. Constraint satisfaction problems solvable by local consistency methods. 2012. submitted.

[3]

A. Bulatov. Bounded relational width. 2009. manuscript.

[4]

A. Bulatov, P. Jeavons, and A. Krokhin. Classifying the complexity of constraints using finite algebras. SIAM J. Comput., 34:720--742, March 2005.

Digital Library

[5]

A. A. Bulatov, A. Krokhin, and B. Larose. Complexity of constraints. chapter Dualities for Constraint Satisfaction Problems, pages 93--124. Springer-Verlag, Berlin, Heidelberg, 2008.

Digital Library

[6]

M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for unique games. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, STOC '06, pages 205--214, New York, NY, USA, 2006. ACM.

Digital Library

[7]

M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for maximum constraint satisfaction problems. ACM Trans. Algorithms, 5:32:1--32:14, July 2009.

Digital Library

[8]

V. Dalmau and A. Krokhin. Robust satisfiability for CSPs: algorithmic and hardness results. 2011. in preparation.

[9]

T. Feder and M. Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput., 28:57--104, February 1999.

Digital Library

[10]

R. Freese, M. Kozik, A. Krokhin, M. Maróti, R. McKenzie, and R. Willard. On Maltsev conditions associated with omitting certain types of local structures. 2011. in preparation.

[11]

M. X. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115--1145, 1995.

Digital Library

[12]

V. Guruswami and Y. Zhou. Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set. In D. Randall, editor, SODA, pages 1574--1589. SIAM, 2011.

Digital Library

[13]

J. Håstad. Some optimal inapproximability results. J. ACM, 48:798--859, July 2001.

Digital Library

[14]

P. Jonsson, A. Krokhin, and F. Kuivinen. Hard constraint satisfaction problems have hard gaps at location 1. Theor. Comput. Sci., 410:3856--3874, September 2009.

Digital Library

[15]

Z. S. Karnin, Y. Rabani, and A. Shpilka. Explicit dimension reduction and its applications. Electronic Colloquium on Computational Complexity (ECCC), 16:121, 2009.

[16]

S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson. The approximability of constraint satisfaction problems. SIAM J. Comput., 30(6):1863--1920, 2000.

Digital Library

[17]

S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 767--775. ACM Press, 2002.

Digital Library

[18]

S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput., 37:319--357, April 2007.

Digital Library

[19]

G. Kun, R. O'Donnell, S. Tamaki, Y. Yoshida, and Y. Zhou. Linear programming, width-1 CSPs and robust satisfaction. 2011. manuscript.

[20]

B. Larose and P. Tesson. Universal algebra and hardness results for constraint satisfaction problems. Theor. Comput. Sci., 410:1629--1647, April 2009.

Digital Library

[21]

B. Larose and L. Zádori. Bounded width problems and algebras. Algebra Universalis, 56(3--4):439--466, 2007.

[22]

P. Raghavendra. Optimal algorithms and inapproximability results for every CSP? In STOC'08, pages 245--254, 2008.

Digital Library

[23]

T. J. Schaefer. The complexity of satisfiability problems. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), pages 216--226. ACM, New York, 1978.

Digital Library

[24]

U. Zwick. Finding almost-satisfying assignments. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, STOC '98, pages 551--560, New York, NY, USA, 1998. ACM.

Digital Library

Cited By

Chou CGolovnev ASudan MVelusamy S(2024)Sketching Approximability of All Finite CSPsJournal of the ACM10.1145/364943571:2(1-74)Online publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1145/3649435
Kolmogorov VThapper JZźivnyź S(2018)The Power of Linear Programming for General-Valued CSPsSIAM Journal on Computing10.1137/13094564844:1(1-36)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1137/130945648
Buln J(2018)On the complexity of H-coloring for special oriented treesEuropean Journal of Combinatorics10.1016/j.ejc.2017.10.00169:C(54-75)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1016/j.ejc.2017.10.001
Show More Cited By

Index Terms

Robust satisfiability of constraint satisfaction problems
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Robust Satisfiability for CSPs: Hardness and Algorithmic Results

An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least a (1 − f(ε))-fraction of constraints for each (1 − ε)-satisfiable instance (i.e., such that at most a ε-fraction of constraints needs to ...
Robustly Solvable Constraint Satisfaction Problems

An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least $(1-g(\varepsilon))$-fraction of the constraints given a $(1-\varepsilon)$-satisfiable instance, where $g(\varepsilon) \rightarrow 0$ as $\...
Complexity of approximating CSP with balance / hard constraints
ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer science

We study two natural extensions of Constraint Satisfaction Problems (CSPs). Balance-Max-CSP requires that in any feasible assignment each element in the domain is used an equal number of times. An instance of Hard-Max-CSP consists of soft constraints ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing

May 2012

1310 pages

ISBN:9781450312455

DOI:10.1145/2213977

General Chair:
Howard Karloff
AT&T Labs--Research
,
Program Chair:
Toniann Pitassi
University of Toronto

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 May 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

STOC'12

Sponsor:

SIGACT

STOC'12: Symposium on Theory of Computing

May 19 - 22, 2012

New York, New York, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
44
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chou CGolovnev ASudan MVelusamy S(2024)Sketching Approximability of All Finite CSPsJournal of the ACM10.1145/364943571:2(1-74)Online publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1145/3649435
Kolmogorov VThapper JZźivnyź S(2018)The Power of Linear Programming for General-Valued CSPsSIAM Journal on Computing10.1137/13094564844:1(1-36)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1137/130945648
Buln J(2018)On the complexity of H-coloring for special oriented treesEuropean Journal of Combinatorics10.1016/j.ejc.2017.10.00169:C(54-75)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1016/j.ejc.2017.10.001
Dalmau VKozik MKrokhin AMakarychev KMakarychev YOpršal JKlein P(2017)Robust algorithms with polynomial loss for near-unanimity CSPsProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039708(340-357)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039708
Thapper JŽivný S(2016)The Complexity of Finite-Valued CSPsJournal of the ACM10.1145/297401963:4(1-33)Online publication date: 21-Sep-2016
https://dl.acm.org/doi/10.1145/2974019
Kozik MKoskinen EGrohe MShankar N(2016)Weak consistency notions for all the CSPs of bounded widthProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934510(633-641)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934510
Dalmau VKrokhin AManokaran RIndyk P(2015)Towards a characterization of constant-factor approximable Min CSPsProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722187(847-857)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722187
Dalmau VEgri LHell PLarose BRafiey A(2015)Descriptive Complexity of List H-Coloring Problems in LogspaceProceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS.2015.52(487-498)Online publication date: 6-Jul-2015
https://dl.acm.org/doi/10.1109/LICS.2015.52
Kolmogorov VKrokhin ARolinek M(2015)The Complexity of General-Valued CSPsProceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2015.80(1246-1258)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1109/FOCS.2015.80
BARTO L(2015)THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRAThe Bulletin of Symbolic Logic10.1017/bsl.2015.2521:3(319-337)Online publication date: 15-Sep-2015
https://doi.org/10.1017/bsl.2015.25
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents