Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

On improving the approximation ratio of the r-shortest common superstring problem

Abstract : The Shortest Common Superstring problem (SCS) consists, for a set of strings S = {s_1,...,s_n}, in finding a minimum length string that contains all s_i, 1<= i <= n, as substrings. While a 2+11/30 approximation ratio algorithm has recently been published, the general objective is now to break the conceptual lower bound barrier of 2. This paper is a step ahead in this direction. Here we focus on a particular instance of the SCS problem, meaning the r-SCS problem, which requires all input strings to be of the same length, r. Golonev et al. proved an approximation ratio which is better than the general one for r<= 6. Here we extend their approach and improve their approximation ratio, which is now better than the general one for r<= 7, and less than or equal to 2 up to r = 6.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02414032
Contributor : Mathieu Raffinot <>
Submitted on : Tuesday, December 17, 2019 - 3:20:14 PM
Last modification on : Friday, March 27, 2020 - 4:00:06 AM
Long-term archiving on: : Wednesday, March 18, 2020 - 4:30:57 PM

File

1805.00060.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02414032, version 1
  • ARXIV : 1805.00060

Citation

Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru. On improving the approximation ratio of the r-shortest common superstring problem. 2019. ⟨hal-02414032⟩

Share

Metrics

Record views

53

Files downloads

29