Venkatesan Guruswami
Euiwoong Lee
ABSTRACT
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 and hard constraints, and the goal is to maximize the weight of satisfied soft constraints while satisfying all the hard constraints. These two extensions contain many fundamental problems not captured by CSPs, and challenge traditional theories about CSPs in a more general framework.
Max-2-SAT and Max-Horn-SAT are the only two nontrivial classes of Boolean CSPs that admit a robust satisfibiality algorithm, i.e., an algorithm that finds an assignment satisfying at least (1 - g(ε)) fraction of constraints given a (1-ε)-satisfiable instance, where g(ε) → 0 as ε → 0, and g(0) = 0. We prove the inapproximability of these problems with balance or hard constraints, showing that each variant changes the nature of the problems significantly (in different ways). For instance, deciding whether an instance of 2-SAT admits a balanced assignment is NP-hard, and for Max-2-SAT with hard constraints, it is hard to find a constant-factor approximation even on (1-ε)-satisfiable instances (in particular, the version with hard constraints does not admit a robust satisfiability algorithm).
- A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev. O(√łog n)-approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems. In Proceedings of the 37th annual ACM Symposium on Theory of Computing, STOC '05, pages 573--581, 2005. Google Scholar
Digital Library
- P. Austrin, S. Benabbas, and K. Georgiou. Better balance by being biased: a 0.8776-approximation for Max Bisection. In Proceedings of the 24th annual ACM-SIAM Symposium on Discrete Algorithms, SODA '13, pages 373--387, 2013.Google ScholarDigital Library
- P. Austrin, S. Khot, and M. Safra. Inapproximability of vertex cover and independent set in bounded degree graphs. In Proceedings of the 24th annual IEEE Conference on Computational Complexity, CCC '09, pages 74--80, 2009. Google ScholarDigital Library
- A. Avidor, I. Berkovitch, and U. Zwick. Improved approximation algorithms for Max NAE-SAT and Max SAT. In T. Erlebach and G. Persinao, editors, Approximation and Online Algorithms, volume 3879 of Lecture Notes in Computer Science, pages 27--40. 2006. Google ScholarDigital Library
- N. Bansal and S. Khot. Inapproximability of hypergraph vertex cover and applications to scheduling problems. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP '10, pages 250--261, 2010. Google ScholarDigital Library
- A. A. Bulatov and D. Marx. Constraint satisfaction problems and global cardinality constraints. Communications of the ACM, 53(9):99--106, 2010. Google ScholarDigital Library
- M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for maximum constraint satisfaction problems. In Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms, SODA '07, pages 62--68, 2007. Google ScholarDigital Library
- N. Creignou, H. Schnoor, and I. Schnoor. Nonuniform boolean constraint satisfaction problems with cardinality constraint. ACM Transactions on Computational Logic, 11(4), 2010. Google ScholarDigital Library
- V. Dalmau and A. Krokhin. Robust satisfiability for CSPs: hardness and algorithmic results. ACM Transactions on Computation Theory, 2013. To appear. Google ScholarDigital Library
- I. Dinur, V. Guruswami, S. Khot, and O. Regev. A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM Journal on Computing, 34(5):1129--1146, 2005. Google ScholarDigital Library
- U. Feige and M. Langberg. The RPR2 rounding technique for semidefinite programs. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP '01, pages 213--224, 2001. Google ScholarDigital Library
- A. M. Frieze and M. Jerrum. Improved approximation algorithms for Max k-Cut and Max Bisection. In Proceedings of the 4th conference on Integer Programming and Combinatorial Optimization, IPCO '95, pages 1--13, 1995. Google ScholarDigital Library
- M. Goemans and D. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics, 7(4):656--666, 1994. Google ScholarDigital Library
- M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115--1145, Nov. 1995. Google ScholarDigital Library
- V. Guruswami and E. Lee. Complexity of approximating CSP with balance / hard constraints. Electronic Colloquium on Computational Complexity (ECCC), TR13-125, 2013.Google Scholar
- V. Guruswami, Y. Makarychev, P. Raghavendra, D. Steurer, and Y. Zhou. Finding almost-perfect graph bisections. In Proceedings of the 2nd symposium on Innovations in Computer Science, ICS '11, pages 321--337, 2011.Google Scholar
- V. Guruswami and Y. Zhou. Tight bounds on the approximability of almost-satisfiable horn SAT and exact hitting set. Theory of Computing, 8(1):239--267, 2012.Google ScholarCross Ref
- E. Halperin and U. Zwick. A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. In Proceedings of the 8th conference on Integer Programming and Combinatorial Optimization, IPCO '01, pages 210--225, 2001. Google ScholarDigital Library
- J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798--859, July 2001. Google ScholarDigital Library
- S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863--1920, 2000. Google ScholarDigital Library
- S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th annual ACM Symposium on Theory of Computing, STOC '02, pages 767--775, 2002. Google ScholarDigital Library
- S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for max-cut and other 2-variable CSPs' SIAM Journal on Computing, 37(1):319--357, 2007. Google ScholarDigital Library
- S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2-ε. Journal of Computer and System Sciences, 74(3):335--349, 2008. Google ScholarDigital Library
- M. Lewin, D. Livnat, and U. Zwick. Improved rounding techniques for the Max 2-SAT and Max Di-Cut problems. In Proceedings of the 9th conference on Integer Programming and Combinatorial Optimization, IPCO '02, pages 67--82, 2002. Google ScholarDigital Library
- E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: Invariance and optimality. Annals of Mathematics, 171:295--341, 2010.Google ScholarCross Ref
- C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425 -- 440, 1991.Google ScholarCross Ref
- P. Raghavendra and N. Tan. Approximating CSPs with global cardinality constraints using SDP hierarchies. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '12, pages 373--387, 2012. Google ScholarDigital Library
- T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th annual ACM Symposium on Theory of Computing, STOC '78, pages 216--226, 1978. Google ScholarDigital Library
- Y. Ye. A .699-approximation algorithm for Max-Bisection. Mathematical Programming, 90(1):101--111, 2001.Google ScholarCross Ref
- U. Zwick. Finding almost-satisfying assignments. In Proceedings of the 30th annual ACM Symposium on Theory of Computing, STOC '98, pages 551--560, 1998. Google ScholarDigital Library
Index Terms
- Complexity of approximating CSP with balance / hard constraints
Recommendations
A Proof of the CSP Dichotomy Conjecture
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to ...
Complexity of Counting CSP with Complex Weights
We give a complexity dichotomy theorem for the counting constraint satisfaction problem (#CSP in short) with algebraic complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of algebraic complex-valued ...
Complexity of Approximating CSP with Balance / Hard Constraints
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