Reoptimization of Steiner Trees

DOI10.1007/978-3-540-69903-3_24zbMATH Open1155.68574OpenAlexW1485443912MaRDI QIDQ3512464FDOQ3512464

Authors D. Bilò, Juraj Hromkovič, Richard Královič, Tobias Mömke, Anna Zych, Hans-Joachim Böckenhauer, Peter Widmayer

Publication date 15 July 2008

Published in Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69903-3_24

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Reoptimization of Steiner trees: changing the terminal set
• New algorithms for Steiner tree reoptimization
• New advances in reoptimizing the minimum Steiner tree problem
• Simple and fast reoptimizations for the Steiner tree problem
• Robust reoptimization of Steiner trees

Cites work

• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• scientific article; zbMATH DE number 970831 (Why is no real title available?)
• On the Hardness of Reoptimization
• Reoptimization of Steiner trees: changing the terminal set
• Simple and fast reoptimizations for the Steiner tree problem
• The Steiner problem with edge lengths 1 and 2
• The Steiner tree problem
• The steiner problem in graphs

Cited in

(26)

• Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
• Reoptimization of the metric deadline TSP
• Robust reoptimization of Steiner trees
• New algorithms for Steiner tree reoptimization
• Reoptimization of the shortest common superstring problem
• Robust reoptimization of Steiner trees
• Knowing all optimal solutions does not help for TSP reoptimization
• Reoptimization of the Metric Deadline TSP
• New advances in reoptimizing the minimum Steiner tree problem
• Reoptimization of NP-Hard Problems
• Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
• Steiner tree reoptimization in graphs with sharpened triangle inequality
• Reoptimization of maximum weight induced hereditary subgraph problems
• Reoptimization of the Shortest Common Superstring Problem
• Reoptimization of minimum and maximum traveling salesman's tours
• 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
• A note on the traveling salesman reoptimization problem under vertex insertion
• Fast reoptimization for the minimum spanning tree problem
• Reoptimization of Weighted Graph and Covering Problems
• Simple and fast reoptimizations for the Steiner tree problem
• Reconfiguration of Steiner trees in an unweighted graph
• Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
• New algorithms for Steiner tree reoptimization

This page was built for publication: Reoptimization of Steiner Trees

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