Kernelization --- preprocessing with a guarantee

  • Authors:

  • Daniel Lokshtanov;Neeldhara Misra;Saket Saurabh

  • Affiliations:

  • University of California, San Diego;The Institute of Mathematical Sciences, Chennai, India;The Institute of Mathematical Sciences, Chennai, India

  • Venue:
  • The Multivariate Algorithmic Revolution and Beyond
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data reduction techniques are widely applied to deal with computationally hard problems in real world applications. It has been a long-standing challenge to formally express the efficiency and accuracy of these "pre-processing" procedures. The framework of parameterized complexity turns out to be particularly suitable for a mathematical analysis of pre-processing heuristics. A kernelization algorithm is a pre-processing algorithm which simplifies the instances given as input in polynomial time, and the extent of simplification desired is quantified with the help of the additional parameter. We give an overview of some of the early work in the area and also survey newer techniques that have emerged in the design and analysis of kernelization algorithms. We also outline the framework of Bodlaender et al. [9] and Fortnow and Santhanam [38] for showing kernelization lower bounds under reasonable assumptions from classical complexity theory, and highlight some of the recent results that strengthen and generalize this framework.