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

Author： Bonnet Édouard   Paschos Vangelis Th.   Sikora Florian  

Publisher： Edp Sciences

E-ISSN： 1290-385x|50|3|227-240

ISSN： 0988-3754

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

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

Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7

By Paschos Vangelis Th.  

RAIRO - Operations Research, Vol. 52, Iss. 1, 2018-05 ,pp. : 305-314

Edp Sciences

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

Approximation algorithms for metric tree cover and generalized tour and tree covers

By Nguyen Viet Hung  

RAIRO - Operations Research, Vol. 41, Iss. 3, 2007-08 ,pp. : 305-315

Edp Sciences

Access to resources Recommend Favorite

Dual parameterization and parameterized approximability of subset graph problems

By Bonnet Édouard   Paschos Vangelis Th.  

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

Edp Sciences

Access to resources Recommend Favorite