Polynomial Kernelizations For MIN F+Pi1 And MAX NP

DOI10.4230/LIPICS.STACS.2009.1851zbMath1236.68096OpenAlexW2568258976MaRDI QIDQ5390011

Stefan Kratsch

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_9521.html

zbMATH Keywords

approximation algorithmsparameterized complexitykernelization

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Hitting Forbidden Minors: Approximation and Kernelization

This page was built for publication: Polynomial Kernelizations For MIN F+Pi1 And MAX NP