Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

ESA
2005
Springer

favoriteEmaildiscussreport

98views Algorithms» more ESA 2005»

Improved Approximation Algorithms for Metric Max TSP

13 years 10 months ago

Improved Approximation Algorithms for Metric Max TSP

Download rnc.r.dendai.ac.jp

We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27 35 . The other is for undirected graphs and its approximation ratio is 7 8 −o(1). Both algorithms improve on the previous bests.

Zhi-Zhong Chen, Takayuki Nagoya

Real-time Traffic

Approximation Ratio | ESA 2005 | Maximum Traveling Salesman | Polynomial-time Approximation Algorithms |

claim paper

Related Content

» Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3Cycle Cover Problem...

» Deterministic 78Approximation for the Metric Maximum TSP

» Improved Approximations for TSP with Simple Precedence Constraints

» Differential approximation results for the traveling salesman and related problems

» Approximating MultiCriteria MaxTSP

» Better approximations for max TSP

» On Approximation Lower Bounds for TSP with Bounded Metrics

» Approximating TSP on metrics with bounded global growth

» On Approximating MultiCriteria TSP

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ESA
Authors	Zhi-Zhong Chen, Takayuki Nagoya

Comments (0)