Reoptimization of the Shortest Common Superstring Problem
2009 (English)In: COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, Springer, 2009, Vol. 5577, 78-91 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Springer, 2009. Vol. 5577, 78-91 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 5577
reoptimization, shortest common superstring problem, approximation
IdentifiersURN: urn:nbn:se:kth:diva-52379DOI: 10.1007/978-3-642-02441-2_8ISI: 000271346600008ISBN: 978-3-642-02440-5OAI: oai:DiVA.org:kth-52379DiVA: diva2:466343
20th Annual Symposium on Combinatorial Pattern Matching, Lille, FRANCE, JUN 22-24, 2009
ProjectsSNF grant 200021-121745/1SBF grant C 06.0108 as part of the COST 293 (GRAAL)
QC 201202072011-12-152011-12-152012-02-07Bibliographically approved