9 search results - page 1 / 2 » Explicit Inapproximability Bounds for the Shortest Superstri... |
71
Voted
MFCS
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. 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 measur...
CPM
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
STRINGOLOGY
2004
15 years 4 days ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
ICTCS
2005
Springer
15 years 4 months ago
2005
Springer
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
123
click to vote
STOC
2012
ACM
13 years 1 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...