The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
From MaRDI portal
Publication:3563002
DOI10.1007/978-3-642-13073-1_17zbMath1284.68654OpenAlexW1560750354MaRDI QIDQ3563002
Karin Freiermuth, Andreas Sprock, Björn Steffen, Tobias Mömke, Juraj Hromkovič, Hans-Joachim Böckenhauer
Publication date: 28 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_17
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (5)
A survey on combinatorial optimization in dynamic environments ⋮ Reoptimization of maximum weight induced hereditary subgraph problems ⋮ Reoptimization of NP-Hard Problems ⋮ Reoptimization in machine scheduling ⋮ Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
This page was built for publication: The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
