Approximation Algorithms Inspired by Kernelization Methods - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Approximation Algorithms Inspired by Kernelization Methods

Résumé

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 Nonblocker, all of them can be considered in the context of securing networks or information propagation.
Fichier principal
Vignette du fichier
approximation.pdf (333.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01505529 , version 1 (11-04-2017)

Identifiants

Citer

Faisal Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau. Approximation Algorithms Inspired by Kernelization Methods. 25th International Symposium, ISAAC 2014, Dec 2014, Jeonju, South Korea. pp.479-490, ⟨10.1007/978-3-319-13075-0_38⟩. ⟨hal-01505529⟩
57 Consultations
107 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More