Reoptimization of the Shortest Common Superstring Problem
From MaRDI portal
Publication:3637106
DOI10.1007/978-3-642-02441-2_8zbMath1247.68334OpenAlexW1561560389MaRDI QIDQ3637106
Dennis Komm, Tobias Mömke, Davide Bilò, Richard Královič, Sebastian Seibert, Anna Zych, Hans-Joachim Böckenhauer
Publication date: 7 July 2009
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_8
Related Items (6)
A survey on combinatorial optimization in dynamic environments ⋮ Steiner tree reoptimization in graphs with sharpened triangle inequality ⋮ A theory and algorithms for combinatorial reoptimization ⋮ Knowing All Optimal Solutions Does Not Help for TSP Reoptimization ⋮ Reoptimization of the metric deadline TSP ⋮ New Reoptimization Techniques applied to Steiner Tree Problem
Cites Work
- Reoptimizing the 0-1 knapsack problem
- Reoptimization of Steiner trees: changing the terminal set
- Algorithmic aspects of bioinformatics. Translated from the German original
- A greedy approximation algorithm for constructing shortest common superstrings
- On finding minimal length superstrings
- On the complexity of postoptimality analysis of \(0/1\) programs
- Reoptimization of Steiner Trees
- Reoptimization of the Metric Deadline TSP
- Reoptimization of Weighted Graph and Covering Problems
- Reoptimizing the traveling salesman problem
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
- On the Hardness of Reoptimization
- Mathematical Foundations of Computer Science 2005
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Scheduling with forbidden sets
This page was built for publication: Reoptimization of the Shortest Common Superstring Problem
