Reoptimization of Steiner Trees
From MaRDI portal
Publication:3512464
DOI10.1007/978-3-540-69903-3_24zbMath1155.68574OpenAlexW1485443912MaRDI QIDQ3512464
Juraj Hromkovič, Davide Bilò, Tobias Mömke, Richard Královič, 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
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items
A survey on combinatorial optimization in dynamic environments, Reoptimization of maximum weight induced hereditary subgraph problems, Robust reoptimization of Steiner trees, 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, Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem, Reoptimization of NP-Hard Problems, Unnamed Item, Reoptimization of the shortest common superstring problem, Reoptimization in machine scheduling, A note on the traveling salesman reoptimization problem under vertex insertion, Knowing All Optimal Solutions Does Not Help for TSP Reoptimization, Reoptimization of the metric deadline TSP, Reoptimization of the Metric Deadline TSP, Fast reoptimization for the minimum spanning tree problem, Reoptimization of Weighted Graph and Covering Problems, Reoptimization of the Shortest Common Superstring Problem, New Reoptimization Techniques applied to Steiner Tree Problem, Reoptimization of minimum and maximum traveling salesman's tours
Cites Work
