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
Recommendations
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cites Work
- The Steiner tree problem
- Title not available (Why is that?)
- On the Hardness of Reoptimization
- The steiner problem in graphs
- Simple and fast reoptimizations for the Steiner tree problem
- Reoptimization of Steiner trees: changing the terminal set
- The Steiner problem with edge lengths 1 and 2
- Title not available (Why is that?)
Cited In (26)
- Reoptimization of the shortest common superstring problem
- Reoptimization of Steiner trees: changing the terminal set
- Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
- Fast reoptimization for the minimum spanning tree problem
- A survey on combinatorial optimization in dynamic environments
- New algorithms for Steiner tree reoptimization
- Simple and fast reoptimizations for the Steiner tree problem
- New algorithms for Steiner tree reoptimization
- New reoptimization techniques applied to Steiner tree problem
- Steiner tree reoptimization in graphs with sharpened triangle inequality
- Reoptimization of Weighted Graph and Covering Problems
- A note on the traveling salesman reoptimization problem under vertex insertion
- Reoptimization in machine scheduling
- Robust reoptimization of Steiner trees
- Reoptimization of NP-Hard Problems
- Reoptimization of minimum and maximum traveling salesman's tours
- Robust reoptimization of Steiner trees
- Reoptimization of the Metric Deadline TSP
- Reoptimization of the Shortest Common Superstring Problem
- Reoptimization of the metric deadline TSP
- Knowing all optimal solutions does not help for TSP reoptimization
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- New advances in reoptimizing the minimum Steiner tree problem
- Reoptimization of maximum weight induced hereditary subgraph problems
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
- Reconfiguration of Steiner trees in an unweighted graph
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)
