Kernelization - Preprocessing with a Guarantee

@inproceedings{Lokshtanov2012KernelizationP,
  title={Kernelization - Preprocessing with a Guarantee},
  author={Daniel Lokshtanov and Neeldhara Misra and Saket Saurabh},
  booktitle={The Multivariate Algorithmic Revolution and Beyond},
  year={2012}
}
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 preprocessing algorithm which simplifies the instances given as input in polynomial time… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 47 CITATIONS

Sailing Routes in the World of Computation

  • Lecture Notes in Computer Science
  • 2018
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Aspects of preprocessing applied to combinatorial graph problems

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…