Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

DOI10.1007/978-3-642-15155-2_43zbMath1287.68077OpenAlexW1876800908MaRDI QIDQ5901155

Dániel Marx, Magnus Wahlström, Stefan Kratsch

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: http://eprints.sztaki.hu/9046/

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (7)

Paradigms for parameterized enumeration ⋮ Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP ⋮ Confronting intractability via parameters ⋮ Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A completeness theory for polynomial (Turing) kernelization

This page was built for publication: Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems