Parameterized complexity and kernelizability of max ones and exact ones problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6281 LNCS, Issue , 2010, Pages 489-500

  Kratsch, Stefan ^a   Marx, Dániel ^b   Wahlström, Magnus ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN RELATIONS; COMPLEXITY LEVELS; CONSTRAINT RELATIONS; FINITE SET; NP-HARD; PARAMETERIZED COMPLEXITY; POLYNOMIAL KERNELS; POLYNOMIAL-TIME; SATISFIABILITY PROBLEMS; SATISFYING ASSIGNMENTS;

COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION;

FORMAL LOGIC;

EID: 78349276899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15155-2_43     Document Type: Conference Paper

References (19)

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)
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)
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)
4. Bulatov, A.A.: Tractable conservative constraint satisfaction problems. In: LICS, p. 321. IEEE, Los Alamitos (2003)
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)
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)
7. Crescenzi, P., Rossi, G.: On the Hamming distance of constraint satisfaction problems. Theoretical Computer Science 288(1), 85-100 (2002)
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)
9. Downey, R.G., Fellows, M.R.: Parameterized Complexity. In: Monographs in Computer Science. Springer, New York (1999)
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)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
12. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30(6), 1863-1920 (2000)
13. Kratsch, S., Wahlström, M.: Preprocessing of min ones problems: A dichotomy. In: ICALP (2010) (to appear)
14. Ladner, R.E.: On the structure of polynomial time reducibility. J. Assoc. Comput. Mach. 22, 155-171 (1975)
15. Marx, D.: Parameterized complexity of constraint satisfaction problems. Computational Complexity 14(2), 153-183 (2005)
16. Nemhauser, G.L., Trotter Jr., L.E.: Vertex packings: structural properties and algorithms. Math. Programming 8, 232-248 (1975)
17. Nordh, G., Zanuttini, B.: Frozen boolean partial co-clones. In: ISMVL, pp. 120-125 (2009)
18. Schaefer, T.J.: The complexity of satisfiability problems. In: STOC, pp. 216-226. ACM, New York (1978)
19. k) time. Inf. Process. Lett. 109(6), 315-318 (2009)