Sciweavers

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

39

APPROX
2004
Springer

favoriteEmaildiscussreport

180views Algorithms» more APPROX 2004»

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One

14 years 4 months ago

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One

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

We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (minimum) asymmetric TSP with weights one and two and a 3/4-approximation algorithm for the Maximum Directed Path Packing Problem.

Markus Bläser

Real-time Traffic

3/4-approximation Algorithm | Algorithms | APPROX 2004 | Asymmetric Tsp | Maximum Asymmetric Tsp |

claim paper

Related Content

» Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

» A Genetic Algorithm Applied to the Maximum Flow Problem

» On Approximating Restricted Cycle Covers

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	APPROX
Authors	Markus Bläser

Comments (0)