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

Author： Demange Marc   Paschos Vangelis Th.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|33|4|481-507

ISSN： 0399-0559

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

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

Differential approximation of NP-hard problems with equal size feasible solutions

By Monnot Jérôme  

RAIRO - Operations Research, Vol. 36, Iss. 4, 2010-03 ,pp. : 279-297

Edp Sciences

Access to resources Recommend Favorite

Element speciation definitions, analytical methodology, and some examples

By Michalke B.  

Ecotoxicology and Environmental Safety, Vol. 56, Iss. 1, 2003-09 ,pp. : 122-139

Elsevier

Access to resources Recommend Favorite

Tractable algorithms for chance-constrained combinatorial problems

By Klopfenstein Olivier  

RAIRO - Operations Research, Vol. 43, Iss. 2, 2009-04 ,pp. : 157-187

Edp Sciences

Access to resources Recommend Favorite

Minmax regret combinatorial optimization problems: an AlgorithmicPerspective

By Candia-Véjar Alfredo   Álvarez-Miranda Eduardo   Maculan Nelson  

RAIRO - Operations Research, Vol. 45, Iss. 2, 2011-08 ,pp. : 101-129

Edp Sciences

Access to resources Recommend Favorite