Theory of Computing Systems

, Volume 59, Issue 1, pp 76–98 | Cite as

Complexity of Approximating CSP with Balance / Hard Constraints

Article

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). We also study hardness results for a certain CSP over a larger domain capturing ordering constraints: we show that hard constraints rule out constant-factor approximation algorithms. All our hardness results are almost optimal — they completely rule out algorithms with certain properties, or can be matched by simple extensions to existing algorithms.

Keywords

Constraint satisfaction problems Complexity dichotomy Approximation algorithms Hardness of approximation Unique games hardness 

References

  1. 1.
    Agarwal, A., Charikar, M., Makarychev, K., Yury, M.: O\((\sqrt {\log 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, pp 573–581 (2005)Google Scholar
  2. 2.
    Austrin, P., Benabbas, S., Georgiou, K.: 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, pp 373–387 (2013)Google Scholar
  3. 3.
    Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC ’09, pp 74–80 (2009)Google Scholar
  4. 4.
    Avidor, A., Berkovitch, I., Zwick, U.: Improved approximation algorithms for Max NAE-SAT and Max SAT. In: Erlebach, T., Persinao, G. (eds.) Approximation and Online Algorithms of Lecture Notes in Computer Science, vol. 3879, pp 27–40 (2006)Google Scholar
  5. 5.
    Bansal, N., Khot, S.: Inapproximability of hypergraph vertex cover and applications to scheduling problems. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP ’10, pp 250–261 (2010)Google Scholar
  6. 6.
    Bulatov, A.A., Marx, D.: Constraint satisfaction problems and global cardinality constraints. Commun. ACM 53(9), 99–106 (2010)CrossRefGoogle Scholar
  7. 7.
    Charikar, M., Makarychev, K., Makarychev, Y.: Near-optimal algorithms for maximum constraint satisfaction problems. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’07, pp 62–68 (2007)Google Scholar
  8. 8.
    Creignou, N., Schnoor, H., Schnoor, I.: Nonuniform boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. 11(4) (2010)Google Scholar
  9. 9.
    Dalmau, V., Krokhin, A.: Robust satisfiability for CSPs: hardness and algorithmic results. ACM Transactions on Computation Theory 5(4), 15:1–15:25 (2013)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover Annals of Mathematics, pp 439–485 (2005)Google Scholar
  11. 11.
    Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM J. Comput. 34(5), 1129–1146 (2005)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Even, G., Naor, J.S., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2), 151–174 (1998)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Feige, U., Langberg, M.: The RPR2 rounding technique for semidefinite programs. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP ’01, pp 213–224 (2001)Google Scholar
  14. 14.
    Frieze, A., Jerrum, M.: Improved approximation algorithms for Max k-Cut and Max Bisection. In: Proceedings of the 4th Conference on Integer Programming and Combinatorial Optimization, IPCO ’95, pp 1–13 (1995)Google Scholar
  15. 15.
    Goemans, M., Williamson, D.: New \(\frac {3}{4}\)-approximation algorithms for the maximum satisfiability problem. SIAM J. Discret. Math. 7(4), 656–666 (1994)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115–1145 (1995)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Guruswami, V., Lee, E.: Complexity of approximating CSP with balance / hard constraints. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, ITCS ’14 (2014)Google Scholar
  18. 18.
    Guruswami, V., Makarychev, Y., Raghavendra, P., Steurer, D., Zhou, Y.: Finding almost-perfect graph bisections. In: Proceedings of the 2nd Symposium on Innovations in Computer Science, ICS ’11, pp 321–337 (2011)Google Scholar
  19. 19.
    Guruswami, V., Manokaran, R., Raghavendra, P.: Beating the random ordering is hard: inapproximability of maximum acyclic subgraph. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS ’08, pp 573–582 (2008)Google Scholar
  20. 20.
    Guruswami, V., Zhou, Y.: Tight bounds on the approximability of almost-satisfiable horn SAT and exact hitting set. Theory of Computing 8(1), 239–267 (2012)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Halperin, E., Zwick, U.: 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, pp 210–225 (2001)Google Scholar
  22. 22.
    Håstad, J.: Some optimal inapproximability results. J. ACM 48(4), 798–859 (2001)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Holmerin, J., Khot, S.: A new PCP outer verifier with applications to homogeneous linear equations and Max-bisection. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC ’04, pp 11–20 (2004)Google Scholar
  24. 24.
    Khanna, S., Sudan, M., Trevisan, L., Williamson, D.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30(6), 1863–1920 (2001)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC ’02, pp 767–775 (2002)Google Scholar
  26. 26.
    Khot, S., Kindler, G., Mossel, E., O’Donnell, R.: Optimal inapproximability results for max-cut and other 2-variable CSPs. SIAM J. Comput. 37(1), 319–357 (2007)MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. J. Comput. Syst. Sci. 74(3), 335–349 (2008)MathSciNetCrossRefMATHGoogle Scholar
  28. 28.
    Lewin, M., Livnat, D., Zwick, U.: 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, pp 67–82 (2002)Google Scholar
  29. 29.
    Mossel, E., O’Donnell, R., Oleszkiewicz, K.: Noise stability of functions with low influences: invariance and optimality. Ann. Math. 171, 295–341 (2010)MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425–440 (1991)MathSciNetCrossRefMATHGoogle Scholar
  31. 31.
    Raghavendra, P., Tan, N.: Approximating CSPs with global cardinality constraints using SDP hierarchies. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’12, pp 373–387 (2012)Google Scholar
  32. 32.
    Schaefer, T.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC ’78, pp 216–226 (1978)Google Scholar
  33. 33.
    Svensson, O.: Hardness of vertex deletion and project scheduling. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques of Lecture Notes in Computer Science, vol. 7408, pp 301–312 (2012)Google Scholar
  34. 34.
    Yinyu, Y.: A .699-approximation algorithm for Max-Bisection. Math. Program. 90(1), 101–111 (2001)MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    Zwick, U.: Finding almost-satisfying assignments. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC ’98, pp 551–560 (1998)Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Computer Science DepartmentCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations