Abstract
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, 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(Γ), we give a classification into five 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(Γ), we refine the classification obtained earlier by taking a closer look at the fixed-parameter tractable cases and classifying the sets Γ for which Exact Ones SAT(Γ) admits a polynomial kernel.
- Faisal N. Abu-Khzam. 2010. A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76, 7 (2010), 524--531. Google Scholar
Digital Library
- Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, and Danny Hermelin. 2009. On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 8 (2009), 423--434. Google Scholar
Digital Library
- Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo. 2011. Kernel bounds for disjoint cycles and disjoint paths. Theoretical Computer Science 412, 35 (2011), 4570--4578. DOI:http://dx.doi.org/ 10.1016/j.tcs.2011.04.039 Google Scholar
Digital Library
- Andrei A. Bulatov. 2002. A dichotomy theorem for constraints on a three-element set. In Proceedings of the 43th Symposium on Foundations of Computer Science. IEEE, 649--658. Google Scholar
Digital Library
- Andrei A. Bulatov. 2003. Tractable conservative constraint satisfaction problems. In LICS. IEEE, 321. Google Scholar
Digital Library
- N. Creignou, S. Khanna, and M. Sudan. 2001. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, Vol. 7. Google Scholar
Digital Library
- Nadia Creignou, Phokion G. Kolaitis, and Bruno Zanuttini. 2008a. Structure identification of boolean relations and plain bases for co-clones. J. Comput. System Sci. 74, 7 (2008), 1103--1115. Google Scholar
Digital Library
- Nadia Creignou, Henning Schnoor, and Ilka Schnoor. 2008b. Non-uniform boolean constraint satisfaction problems with cardinality constraint. In CSL(LNCS), Vol. 5213. Springer, 109--123. Google Scholar
Digital Library
- P. Crescenzi and G. Rossi. 2002. On the hamming distance of constraint satisfaction problems. Theoretical Computer Science 288, 1 (2002), 85--100. Google Scholar
Digital Library
- Michael Dom, Daniel Lokshtanov, and Saket Saurabh. 2009. Incompressibility through colors and IDs. In ICALP (1) (LNCS), Vol. 5555. Springer, 378--389. Google Scholar
Digital Library
- R. G. Downey and M. R. Fellows. 1999. Parameterized Complexity. Springer, New York. Google Scholar
Digital Library
- Paul Erdős and Richard Rado. 1960. Intersection theorems for systems of sets. J. London Math. Soc. 35 (1960), 85--90.Google Scholar
Cross Ref
- Tomás Feder and Moshe Y. Vardi. 1999. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Comput. 28, 1 (1999), 57--104. Google Scholar
Digital Library
- Jörg Flum and Martin Grohe. 2006. Parameterized Complexity Theory. Springer. Google Scholar
Digital Library
- Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, and Xi Wu. 2013. A completeness theory for polynomial (turing) kernelization. In IPEC. 202--215.Google Scholar
- Sanjeev Khanna, Madhu Sudan, Luca Trevisan, and David P. Williamson. 2000. The approximability of constraint satisfaction problems. SIAM J. Comput. 30, 6 (2000), 1863--1920. Google Scholar
Digital Library
- Stefan Kratsch, Dániel Marx, and Magnus Wahlström. 2010. Parameterized complexity and kernelizability of max ones and exact ones problems. In MFCS (LNCS), Vol. 6281. Springer Berlin, 489--500. DOI:http://dx.doi.org/10.1007/978-3-642-15155-2_43 Google Scholar
Digital Library
- Stefan Kratsch and Magnus Wahlström. 2010. Preprocessing of min ones problems: A dichotomy. In ICALP (1)(LNCS), Vol. 6198. Springer Berlin, 653--665. DOI:http://dx.doi.org/10.1007/978-3-642-14165-2_55 Google Scholar
Digital Library
- Richard E. Ladner. 1975. On the structure of polynomial time reducibility. J. Assoc. Comput. Mach. 22 (1975), 155--171. Google Scholar
Digital Library
- Dániel Marx. 2005. Parameterized complexity of constraint satisfaction problems. Computational Complexity 14, 2 (2005), 153--183. Google Scholar
Digital Library
- G. L. Nemhauser and L. E. Trotter, Jr. 1975. Vertex packings: Structural properties and algorithms. Math. Programming 8 (1975), 232--248.Google Scholar
Digital Library
- G. Nordh and B. Zanuttini. 2009. Frozen boolean partial co-clones. In ISMVL. 120--125. Google Scholar
Digital Library
- Thomas J. Schaefer. 1978. The complexity of satisfiability problems. In STOC. ACM, 216--226. DOI:http://dx. doi.org/10.1145/800133.804350 Google Scholar
Digital Library
- Ryan Williams. 2009. Finding paths of length k in O*(2k) time. Inf. Process. Lett. 109, 6 (2009), 315--318. Google Scholar
Digital Library
Index Terms
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
Recommendations
Parameterized complexity and kernelizability of max ones and exact ones problems
MFCS'10: Proceedings of the 35th international conference on Mathematical foundations of computer scienceFor a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task is to find a satisfying assignment with at least/exactly k variables set to 1, ...
Parameterized complexity dichotomy for Steiner Multicut
We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = { T 1 , ź , T t } , T i ź V ( G ) , of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that ...
Incremental Problems in the Parameterized Complexity Setting
Dynamic systems are becoming steadily more important with the profusion of mobile and distributed computing devices. Coincidentally incremental computation is a natural approach to deal with ongoing changes. We explore incremental computation in the ...






Comments