A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Approximation algorithms for the shortest common superstring problem
Information and Computation
Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
More on the complexity of common superstring and supersequence problems
Theoretical Computer Science
On finding minimal, maximal, and consistent sequences over a binary alphabet
Theoretical Computer Science
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
Rotations of periodic strings and short superstrings
Journal of Algorithms
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
SIAM Journal on Computing
An 8/13-approximation algorithm for the asymmetric maximum TSP
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The greedy algorithm for shortest superstrings
Information Processing Letters
Why Greed Works for Shortest Common Superstring Problem
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Reoptimization of the Shortest Common Superstring Problem
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Why greed works for shortest common superstring problem
Theoretical Computer Science
Restricted and swap common superstring: a parameterized view
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
A probabilistic PTAS for shortest common superstring
Theoretical Computer Science
| Hi-index | 0.00 |
Given a set of strings S = {s1,..., sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measures of success in this problem: the length measure, which is the length of s, and the compression measure, which is the difference between the sum of lengths of the si and the length of s. Both the length and the compression versions of the problem are known to be MAX-SNP-hard. The only explicit approximation ratio lower bounds are by Ott: 1.000057 for the length measure and 1.000089 for the compression measure. Using a natural construction we improve these lower bounds to 1.00082 for the length measure and 1.00093 for the compression measure. Our lower bounds hold even for instances in which the strings are over a binary alphabet and have equal lengths. In fact, we show a somewhat surprising result, that the Shortest Superstring problem (with respect to both measures) is as hard to approximate on instances over a binary alphabet, as it is over any alphabet.