New Advances in Reoptimizing the Minimum Steiner Tree Problem

DOI10.1007/978-3-642-32589-2_19zbMath1365.68466OpenAlexW2103907104MaRDI QIDQ2912720

Davide Bilò, Anna Zych

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_19

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (7)

On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Robust reoptimization of Steiner trees ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem ⋮ Unnamed Item ⋮ Reoptimization in machine scheduling ⋮ A note on the traveling salesman reoptimization problem under vertex insertion

This page was built for publication: New Advances in Reoptimizing the Minimum Steiner Tree Problem