Approximation Algorithms Inspired by Kernelization Methods

  title={Approximation Algorithms Inspired by Kernelization Methods},
  author={Faisal N. Abu-Khzam and Cristina Bazgan and Morgan Chopin and Henning Fernau},
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. We exemplify this method to obtain the currently best approximation algorithms for Harmless Set, Differential and Multiple… CONTINUE READING
1 Citations
29 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 29 references

and H

  • F. N. Abu-Khzam, C. Bazgan, M. Chopin
  • Fernau. Technical Report 1409.3742, ArXiv/CoRR…
  • 2014
Highly Influential
8 Excerpts

The differential and the Roman domination number of a graph

  • S. Bermudo, H. Fernau, J. M. Sigarreta
  • Applic. Anal. & Disc. Math., 8:155–171,
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…