Reoptimization of the Shortest Common Superstring Problem


A reoptimization problem describes the following scenario: given an instance of an optimization problem together with an optimal solution for it, we want to find a good solution for a locally modified instance. In this paper, we deal with reoptimization variants of the shortest common superstring problem (SCS) where the local modifications consist of adding or removing a single string. We show the NP-hardness of these reoptimization problems and design several approximation algorithms for them. First, we use a technique of iteratively using any SCS algorithm to design an approximation algorithm for the reoptimization variant of adding a string whose approximation ratio is arbitrarily close to 8/5 and another algorithm for deleting a string with a ratio tending to 13/7. Both algorithms significantly improve over the best currently known SCS approximation ratio of 2.5. Additionally, this iteration technique can be used to design an improved SCS approximation algorithm (without reoptimization) if the input instance contains a long string, which might be of independent interest. However, these iterative algorithms are relatively slow. Thus, we present another, faster approximation algorithm for inserting a string which is based on cutting the given optimal solution and achieves an approximation ratio of 11/6. Moreover, we give some lower bounds on the approximation ratio which can be achieved by algorithms that use such cutting strategies.

DOI: 10.1007/s00453-010-9419-8

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Bil2009ReoptimizationOT, title={Reoptimization of the Shortest Common Superstring Problem}, author={Davide Bil{\`o} and Hans-Joachim B{\"{o}ckenhauer and Dennis Komm and Richard Kr{\'a}lovic and Tobias M{\"{o}mke and Sebastian Seibert and Anna Zych}, journal={Algorithmica}, year={2009}, volume={61}, pages={227-251} }