Abstract
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 where the local modifications consist of adding or removing a single string. We show NP-hardness of these reoptimization problems and design several approximation algorithms for them. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Bilò, D., Böckenhauer, H. J., Komm, D., Královič, R., Mömke, T., Seibert, S., & Zych, A. (2009). Reoptimization of the Shortest Common Superstring Problem (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5577 LNCS, pp. 78–91). https://doi.org/10.1007/978-3-642-02441-2_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
