A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Scheduling with forbidden sets
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
On the complexity of postoptimality analysis of 0/1 programs
Discrete Applied Mathematics
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
SIAM Journal on Computing
Algorithmic Aspects of Bioinformatics (Natural Computing Series)
Algorithmic Aspects of Bioinformatics (Natural Computing Series)
Reoptimization of Steiner Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Reoptimization of the Metric Deadline TSP
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Reoptimization of Steiner trees: Changing the terminal set
Theoretical Computer Science
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Reoptimization of minimum and maximum traveling salesman's tours
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Knowing all optimal solutions does not help for TSP reoptimization
Computation, cooperation, and life
Steiner tree reoptimization in graphs with sharpened triangle inequality
Journal of Discrete Algorithms
The steiner tree reoptimization problem with sharpened triangle inequality
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Reoptimization of the maximum weighted Pk-free subgraph problem under vertex insertion
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
A theory and algorithms for combinatorial reoptimization
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.01 |
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.