Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > MAXIMUM ASYMMETRIC TRAVELING SALESPERSON:
Reports tagged with Maximum Asymmetric Traveling Salesperson:
TR11-156 | 23rd November 2011
Marek Karpinski, Richard Schmied

Improved Lower Bounds for the Shortest Superstring and Related Problems

Revisions: 1

We study the approximation hardness of the Shortest Superstring, the Maximal Compression and
the Maximum Asymmetric Traveling Salesperson (MAX-ATSP) problem.
We introduce a new reduction method that produces strongly restricted instances of
the Shortest Superstring problem, in which the maximal orbit size is eight
(with no ... more >>>




ISSN 1433-8092 | Imprint