Approximation hardness of graphic TSP on cubic graphs

E-ISSN： 1290-3868|49|4|651-668

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.49, Iss.4, 2015-03, pp. : 651-668

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

Improved approximations for ordered TSP on near-metric graphs∗∗∗

By Böckenhauer Hans-Joachim Steinová Monika Steinová

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 5, 2015-01 ,pp. : 479-494

Edp Sciences

Access to resources Recommend Favorite

Analysis of a near-metric TSP approximation algorithm∗

By Krug Sacha

RAIRO - Theoretical Informatics and Applications, Vol. 47, Iss. 3, 2013-08 ,pp. : 293-314

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

Perfect Matching in General vs. Cubic Graphs:A Note on the Planar and Bipartite Cases

By Bampis E. Giannakos A. Karzanov A. Manoussakis Y. Milis I.

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 2, 2010-03 ,pp. : 87-97

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