Sciweavers

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

12

WADS
2007
Springer

favoriteEmaildiscussreport

189views Algorithms» more WADS 2007»

35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality

13 years 10 months ago

35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality

Download www.mimuw.edu.pl

We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 which improves on the previous 31/40 factor of Bl¨aser, Ram and Sviridenko [1]. Keywords. Traveling salesman problem, asymmetric, maximum, triangle inequality, approximation, algorithm.

Lukasz Kowalik, Marcin Mucha

Real-time Traffic

Algorithm Achieves Approximation | Algorithms | Traveling Salesman Problem | Triangle Inequality | WADS 2007 |

claim paper

Related Content

» An improved approximation algorithm for the asymmetric TSP with strengthened triangle ineq...

» A new approximation algorithm for the asymmetric TSP with triangle inequality

» On Approximating MultiCriteria TSP

» Deterministic 78Approximation for the Metric Maximum TSP

» Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs

» LiftandProject Integrality Gaps for the Traveling Salesperson Problem

» Approximation Algorithms for MultiCriteria Traveling Salesman Problems

» Degree Bounded Network Design with Metric Costs

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WADS
Authors	Lukasz Kowalik, Marcin Mucha

Comments (0)