The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract)

DOI10.1007/978-3-642-13073-1_17MaRDI QIDQ3563002zbMATHOpenAlexFDO

Authors Karin Freiermuth, Juraj Hromkovič, Tobias Mömke, Andreas Sprock, Björn Steffen, 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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Steiner tree reoptimization in graphs with sharpened triangle inequality
• Reoptimization of Steiner trees: changing the terminal set
• New algorithms for Steiner tree reoptimization
• Robust reoptimization of Steiner trees
• Robust reoptimization of Steiner trees

Cited in

(11)

• Knowing all optimal solutions does not help for TSP reoptimization
• New advances in reoptimizing the minimum Steiner tree problem
• Reoptimization of NP-Hard Problems
• scientific article; zbMATH DE number 1305468 (Why is no real title available?)
• Steiner tree reoptimization in graphs with sharpened triangle inequality
• Reoptimization of maximum weight induced hereditary subgraph problems
• Reoptimization in machine scheduling
• Reoptimization of Steiner trees: changing the terminal set
• New reoptimization techniques applied to Steiner tree problem
• A survey on combinatorial optimization in dynamic environments
• Reconfiguration of Steiner trees in an unweighted graph

This page was built for publication: The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563002)