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

Author： Paschos Vangelis Th.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|52|1|305-314

ISSN： 0399-0559

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

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

Asymptotic differential approximation ratio:Definitions, motivations and application to some combinatorial problems

By Demange Marc   Paschos Vangelis Th.  

RAIRO - Operations Research, Vol. 33, Iss. 4, 2010-03 ,pp. : 481-507

Edp Sciences

Access to resources Recommend Favorite

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation

By Cerioli Marcia R.   Faria Luerbio   Ferreira Talita O.   Protti Fábio  

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 3, 2011-09 ,pp. : 331-346

Edp Sciences

Access to resources Recommend Favorite

The complexity of short schedulesfor uet bipartite graphs

By Bampis Evripidis  

RAIRO - Operations Research, Vol. 33, Iss. 3, 2010-03 ,pp. : 367-370

Edp Sciences

Access to resources Recommend Favorite

A note on the hardness results for the labeledperfect matching problems in bipartite graphs

By Monnot Jérôme  

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 315-324

Edp Sciences

Access to resources Recommend Favorite