Fast Local Search for Steiner Trees in Graphs
From MaRDI portal
Publication:5233588
DOI10.1137/1.9781611972900.1zbMath1430.68248OpenAlexW23087583MaRDI QIDQ5233588
Eduardo Uchoa, Renato F. Werneck
Publication date: 11 September 2019
Published in: 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/76b870cbb3fe1dd6ed6bd5101328ecebaca347da
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
A practical greedy approximation for the directed Steiner tree problem ⋮ A Practical Greedy Approximation for the Directed Steiner Tree Problem ⋮ Approximation algorithms for Steiner forest: An experimental study ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Thinning out Steiner trees: a node-based model for uniform edge costs ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
This page was built for publication: Fast Local Search for Steiner Trees in Graphs
