Improved Lower Bounds on the Approximability of the Traveling Salesman Problem

Author： Böckenhauer Hans-Joachim   Seibert Sebastian  

Publisher： Edp Sciences

E-ISSN： 1290-385x|34|3|213-255

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.34, Iss.3, 2010-03, pp. : 213-255

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

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

Double evolutsional artificial bee colony algorithm for multiple traveling salesman problem

By  

MATEC Web of conference, Vol. 44, Iss. issue, 2016-03 ,pp. : 02025-02025

Edp Sciences

Access to resources Recommend Favorite

Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm

By  

MATEC Web of conference, Vol. 100, Iss. issue, 2017-03 ,pp. : 02025-02025

Edp Sciences

Access to resources Recommend Favorite

An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks

By Xiong Naixue   Wu Wenliang   Wu Chunxue  

Sustainability, Vol. 9, Iss. 6, 2017-06 ,pp. : 985-985

MDPI

Access to resources Recommend Favorite

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem

By Zia Mohammed   Cakir Ziyadin   Seker Dursun Zafer  

ISPRS International Journal of Geo-Information, Vol. 7, Iss. 3, 2018-03 ,pp. : 115-115

MDPI

Access to resources Recommend Favorite