Geodesic
Dual parameterization and parameterized approximability of subset graph problems
Bonnet, Édouard1  ; Paschos, Vangelis Th.2 
1 Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), 1051 Budapest, Hungary.
2 PSL* Research University, Université Paris-Dauphine, LAMSADE, CNRS UMR 7243, Paris, France.
RAIRO - Operations Research - Recherche Opérationnelle, Tome 51 (2017) no. 1, pp. 261-266

Voir la notice de l'article provenant de la source Numdam

We discuss approximability in FPT-time for the class of subset optimization graph problems where a feasible solution S is a subset of the vertex set of the input graph. This class encompasses many well-known problems, such as min dominating set, min vertex cover, max independent set, min feedback vertex set. We study approximability of such problems with respect to the dual parameter n-k where n is size of the vertex set and k the standard parameter. We show that under such parameterization, many of these problems, while W[·]-hard, admit parameterized approximation schemata.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2016018
Classification : 68Q15, 68Q17, 68R10, 68W25
Keywords: Polynomial approximation, parameterized approximation, subset problems

Bonnet, Édouard 1 ; Paschos, Vangelis Th. 2

1 Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), 1051 Budapest, Hungary.
2 PSL* Research University, Université Paris-Dauphine, LAMSADE, CNRS UMR 7243, Paris, France. 
@article{RO_2017__51_1_261_0,
     author = {Bonnet, \'Edouard and Paschos, Vangelis Th.},
     title = {Dual parameterization and parameterized approximability of subset graph problems},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {261--266},
     publisher = {EDP-Sciences},
     volume = {51},
     number = {1},
     year = {2017},
     doi = {10.1051/ro/2016018},
     zbl = {1362.68290},
     mrnumber = {3605903},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2016018/}
}
TY  - JOUR
AU  - Bonnet, Édouard
AU  - Paschos, Vangelis Th.
TI  - Dual parameterization and parameterized approximability of subset graph problems
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2017
SP  - 261
EP  - 266
VL  - 51
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2016018/
DO  - 10.1051/ro/2016018
LA  - en
ID  - RO_2017__51_1_261_0
ER  - 
%0 Journal Article
%A Bonnet, Édouard
%A Paschos, Vangelis Th.
%T Dual parameterization and parameterized approximability of subset graph problems
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2017
%P 261-266
%V 51
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2016018/
%R 10.1051/ro/2016018
%G en
%F RO_2017__51_1_261_0
Bonnet, Édouard; Paschos, Vangelis Th. Dual parameterization and parameterized approximability of subset graph problems. RAIRO - Operations Research - Recherche Opérationnelle, Tome 51 (2017) no. 1, pp. 261-266. doi: 10.1051/ro/2016018

Cité par Sources :