Lower bounds on kernelization

@article{Misra2011LowerBO,
  title={Lower bounds on kernelization},
  author={Neeldhara Misra and Venkatesh Raman and Saket Saurabh},
  journal={Discrete Optimization},
  year={2011},
  volume={8},
  pages={110-128}
}
Preprocessing (data reduction or kernelization) to reduce instance size is one of the most commonly deployed heuristics in the implementation practice to tackle computationally hard problems. However, a systematic theoretical study of them remained elusive so far. One of the reasons for this is that if an input to an NP -hard problem can be processed in… CONTINUE READING