Super-polynomial approximation branching algorithms∗

Author： Escoffier Bruno   Paschos Vangelis Th.   Tourniaire Emeric  

Publisher： Edp Sciences

E-ISSN： 1290-3868|50|4-5|979-994

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.50, Iss.4-5, 2016-11, pp. : 979-994

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

Polynomial time algorithms for two classes of subgraph problem

By Sridharan Sriraman  

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 291-298

Edp Sciences

Access to resources Recommend Favorite

Approximation algorithms for the design of SDH/SONET networks

By Brauner Nadia   Crama Yves   Finke Gerd   Lemaire Pierre   Wynants Christelle  

RAIRO - Operations Research, Vol. 37, Iss. 4, 2010-03 ,pp. : 235-247

Edp Sciences

Access to resources Recommend Favorite

Approximation Algorithms for the Traveling Salesman Problem with Range Condition

By D. Arun Kumar C.   Pandu Rangan C.  

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 3, 2010-03 ,pp. : 173-181

Edp Sciences

Access to resources Recommend Favorite

A Review of Image Fusion Algorithms Based on the Super-Resolution Paradigm

By Garzelli Andrea  

Remote Sensing, Vol. 8, Iss. 10, 2016-09 ,pp. : 797-797

MDPI

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