Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR11-156 | 8th August 2012 15:21

Improved Lower Bounds for the Shortest Superstring and Related Problems

RSS-Feed

Abstract:

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 six
(with no character appearing more than six times) and all given strings having length at most four.
Based on this reduction method, we are able to improve the best up to now known approximation lower bound
for the Shortest Superstring problem and the Maximal Compression problem by an order of magnitude.
The results imply also an improved approximation lower bound for the MAX-ATSP problem.


Paper:

TR11-156 | 23rd November 2011 09:40

Improved Lower Bounds for the Shortest Superstring and Related Problems


Abstract:

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 character appearing more than eight times) and all given strings having length at most six.
Based on this reduction method, we are able to improve the best up to now known approximation lower bound
for the Shortest Superstring problem and the Maximal Compression problem by an order of magnitude.
The results imply also an improved approximation lower bound for the MAX-ATSP problem.



ISSN 1433-8092 | Imprint