New advances in reoptimizing the minimum Steiner tree problem

DOI10.1007/978-3-642-32589-2_19MaRDI QIDQ2912720zbMATH OpenOpenAlexFDO

Authors D. 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)

Recommendations

• Reoptimization of Steiner Trees
• Reoptimization of Steiner trees: changing the terminal set
• Simple and fast reoptimizations for the Steiner tree problem
• New algorithms for Steiner tree reoptimization
• The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract)

Cited in

(11)

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

This page was built for publication: New advances in reoptimizing the minimum Steiner tree problem

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