Data compression: methods and theory
Data compression: methods and theory
Approximation algorithms for the shortest common superstring problem
Information and Computation
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
More on the complexity of common superstring and supersequence problems
Theoretical Computer Science
Shortest common superstrings and scheduling with coordinated starting times
Theoretical Computer Science
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
SIAM Journal on Computing
Towards a DNA sequencing theory (learning a string)
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Long tours and short superstrings
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
An explicit lower bound for TSP with distances one and two
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On shortest common superstring and swap permutations
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Restricted common superstring and restricted common supersequence
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Restricted and swap common superstring: a parameterized view
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A probabilistic PTAS for shortest common superstring
Theoretical Computer Science
| Hi-index | 0.00 |
The shortest common superstring problem (SCS) is known to be NP-hard and APX-hard. The APX-hardness was proved for the SCS in [BJLTY94], but the reduction used in that paper produces instances with arbitrarily large alphabets. We show that the problem is APX-hard even if the size of the alphabet is 2. A lot of results concerning approximation algorithms have been published. We use our result to establish the first explicit inapproximability results for the SCS.