8 search results - page 1 / 2 » Conditional Inequalities and the Shortest Common Superstring... |
STRINGOLOGY
2004
13 years 6 months 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...
CPM
2010
Springer
13 years 9 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...
CPM
2009
Springer
13 years 11 months ago
2009
Springer
SIAMDM
1998
13 years 4 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
MP
2006
13 years 4 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...