Change search
ReferencesLink to record
Permanent link

Direct link
Reoptimization of the Shortest Common Superstring Problem
ETH Zurich.
ETH Zurich.
ETH Zurich.
ETH Zurich.
Show others and affiliations
2009 (English)In: COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, Springer, 2009, Vol. 5577, 78-91 p.Conference paper (Refereed)
Abstract [en]

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
Keyword [en]
reoptimization, shortest common superstring problem, approximation
National Category
Computer Science
URN: urn:nbn:se:kth:diva-52379DOI: 10.1007/978-3-642-02441-2_8ISI: 000271346600008ISBN: 978-3-642-02440-5OAI: diva2:466343
20th Annual Symposium on Combinatorial Pattern Matching, Lille, FRANCE, JUN 22-24, 2009
SNF grant 200021-121745/1SBF grant C 06.0108 as part of the COST 293 (GRAAL)
QC 20120207Available from: 2011-12-15 Created: 2011-12-15 Last updated: 2012-02-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Mömke, Tobias
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 15 hits
ReferencesLink to record
Permanent link

Direct link