Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

  • Stefan Kratsch
  • Dániel Marx
  • Magnus Wahlström
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6281)

Abstract

For a finite set \(\it\Gamma\) of Boolean relations, Max Ones SAT(\(\it\Gamma\)) and Exact Ones SAT(\(\it\Gamma\)) are generalized satisfiability problems where every constraint relation is from \(\it\Gamma\), and the task is to find a satisfying assignment with at least/exactly k variables set to 1, respectively. We study the parameterized complexity of these problems, including the question whether they admit polynomial kernels. For Max Ones SAT(\(\it\Gamma\)), we give a classification into 5 different complexity levels: polynomial-time solvable, admits a polynomial kernel, fixed-parameter tractable, solvable in polynomial time for fixed k, and NP-hard already for k = 1. For Exact Ones SAT(\(\it\Gamma\)), we refine the classification obtained earlier by having a closer look at the fixed-parameter tractable cases and classifying the sets \(\it\Gamma\) for which Exact Ones SAT(\(\it\Gamma\)) admits a polynomial kernel.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563–574. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 635–646. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: Proc. 43th Symp. Foundations of Computer Science, pp. 649–658. IEEE, Los Alamitos (2002)Google Scholar
  4. 4.
    Bulatov, A.A.: Tractable conservative constraint satisfaction problems. In: LICS, p. 321. IEEE, Los Alamitos (2003)Google Scholar
  5. 5.
    Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. In: SIAM Monographs on Discrete Mathematics and Applications, vol. 7 (2001)Google Scholar
  6. 6.
    Creignou, N., Schnoor, H., Schnoor, I.: Non-uniform boolean constraint satisfaction problems with cardinality constraint. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 109–123. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Crescenzi, P., Rossi, G.: On the Hamming distance of constraint satisfaction problems. Theoretical Computer Science 288(1), 85–100 (2002)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and ids. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 378–389. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. In: Monographs in Computer Science. Springer, New York (1999)Google Scholar
  10. 10.
    Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput. 28(1), 57–104 (1999)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar
  12. 12.
    Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30(6), 1863–1920 (2000)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Kratsch, S., Wahlström, M.: Preprocessing of min ones problems: A dichotomy. In: ICALP (2010) (to appear)Google Scholar
  14. 14.
    Ladner, R.E.: On the structure of polynomial time reducibility. J. Assoc. Comput. Mach. 22, 155–171 (1975)MATHMathSciNetGoogle Scholar
  15. 15.
    Marx, D.: Parameterized complexity of constraint satisfaction problems. Computational Complexity 14(2), 153–183 (2005)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Nemhauser, G.L., Trotter Jr., L.E.: Vertex packings: structural properties and algorithms. Math. Programming 8, 232–248 (1975)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Nordh, G., Zanuttini, B.: Frozen boolean partial co-clones. In: ISMVL, pp. 120–125 (2009)Google Scholar
  18. 18.
    Schaefer, T.J.: The complexity of satisfiability problems. In: STOC, pp. 216–226. ACM, New York (1978)Google Scholar
  19. 19.
    Williams, R.: Finding paths of length k in O *(2k) time. Inf. Process. Lett. 109(6), 315–318 (2009)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Stefan Kratsch
    • 1
  • Dániel Marx
    • 2
  • Magnus Wahlström
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.Tel Aviv UniversityIsrael

Personalised recommendations