Sciweavers

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

37

WADS
2005
Springer

favoriteEmaildiscussreport

187views Algorithms» more WADS 2005»

Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems

14 years 4 months ago

Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems

Download www-cc.cs.uni-saarland.de

We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ∆-Max-ATSP and a 3 4-approximation algorithm for Max-3-DCC with polynomial running time. The results are obtained via a new way of applying techniques for computing undirected cycle covers to directed problems. Key words: Approximation algorithm, Traveling Salesman Problem, cycle cover, blossom inequalities.

Markus Bläser, L. Shankar Ram, Maxim Sviriden

Real-time Traffic

Algorithms | Classical Traveling Salesman | Cycle Cover | Traveling Salesman Problem | WADS 2005 |

claim paper

Related Content

» 3544Approximation for Asymmetric Maximum TSP with Triangle Inequality

» Approximating Maximum Subgraphs without Short Cycles

» Improved approximation algorithms for minimum ANDcircuits problem via kset cover

» Improved Approximation Algorithms for Maximum Graph Partitioning Problems

» Improved Approximation Algorithms for Metric Max TSP

» Deterministic 78Approximation for the Metric Maximum TSP

» ConstantTime Approximation Algorithms via Local Improvements

» An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

» On Approximating MultiCriteria TSP

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WADS
Authors	Markus Bläser, L. Shankar Ram, Maxim Sviridenko

Comments (0)