Dual parameterization and parameterized approximability of subset graph problems

Author： Bonnet Édouard   Paschos Vangelis Th.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|51|1|261-266

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.51, Iss.1, 2017-02, pp. : 261-266

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems

By Bonnet Édouard   Paschos Vangelis Th.   Sikora Florian  

RAIRO - Theoretical Informatics and Applications, Vol. 50, Iss. 3, 2016-12 ,pp. : 227-240

Edp Sciences

Access to resources Recommend Favorite

Graph cuts applied to transmission path problems in statistical energy analysis models

By Guasch Oriol   Cortes Lluis   Aragones Angels  

INTER-NOISE and NOISE-CON Congress and Conference Proceedings, Vol. 2009, Iss. 8, 2009-04 ,pp. : 306-315

Institute of Noise Control Engineering

Access to resources Recommend Favorite

A note on dual approximation algorithms for class constrained bin packing problems

By Xavier Eduardo C.   Miyazawa Flàvio Keidi  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 2, 2008-10 ,pp. : 239-248

Edp Sciences

Access to resources Recommend Favorite

Primal-dual approximation algorithms for a packing-covering pair of problems

By Kovaleva Sofia   Spieksma Frits C.R.  

RAIRO - Operations Research, Vol. 36, Iss. 1, 2010-03 ,pp. : 53-71

Edp Sciences

Access to resources Recommend Favorite

On the parameterized complexity of approximate counting

By Andrés Montoya J.  

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 2, 2011-06 ,pp. : 197-223

Edp Sciences

Access to resources Recommend Favorite