Better approximations for max TSP

13 years 4 months ago

Download www.ii.uni.wroc.pl

We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r < 25/33.

Refael Hassin, Shlomi Rubinstein

Real-time Traffic

IPL 2000 | Polynomial Time Approximation | Randomized Algorithm | Salesman Problem |

claim paper

» Approximating MultiCriteria MaxTSP

» Approximability of the Multiple Stack TSP

» On Approximating MultiCriteria TSP

» Differential approximation results for the traveling salesman and related problems

» Approximation Bounds for Semidefinite Relaxation of MaxMinFair Multicast Transmit Beamform...

» Quality of Service and MaxMin Fair Transmit Beamforming to Multiple Cochannel Multicast Gr...

» NearestNeighbor Search on a Time Budget via MaxMargin Trees

» Approximating MinMax Regret Versions of Some Polynomial Problems

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	IPL
Authors	Refael Hassin, Shlomi Rubinstein

Comments (0)

Sciweavers

Better approximations for max TSP

IPL 2000 | Polynomial Time Approximation | Randomized Algorithm | Salesman Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers