Invitation to data reduction and problem kernelization

  title={Invitation to data reduction and problem kernelization},
  author={Jiong Guo and Rolf Niedermeier},
  journal={SIGACT News},
To solve NP-hard problems, polynomial-time preprocessing is a natural and promising approach. Preprocessing is based on data reduction techniques that take a problem's input instance and try to perform a reduction to a smaller, equivalent problem kernel. Problem kernelization is a methodology that is rooted in parameterized computational complexity. In this brief survey, we present data reduction and problem kernelization as a promising research field for algorithm and complexity theory. 
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.
220 Citations
6 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 220 extracted citations


Publications referenced by this paper.
Showing 1-6 of 6 references

Approximation algorithms for NP-complete problems on planar graphs

  • B. S. Baker
  • Journal of the ACM, 41(1):153–180,
  • 1994
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…