Contraction-Based Steiner Tree Approximations in Practice
From MaRDI portal
Publication:3104598
DOI10.1007/978-3-642-25591-5_6zbMath1329.68286OpenAlexW113862924MaRDI QIDQ3104598
Matthias Woste, Markus Chimani
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_6
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)
Related Items (6)
The Influence of Preprocessing on Steiner Tree Approximations ⋮ A practical greedy approximation for the directed Steiner tree problem ⋮ A Practical Greedy Approximation for the Directed Steiner Tree Problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Strong Steiner Tree Approximations in Practice ⋮ Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
This page was built for publication: Contraction-Based Steiner Tree Approximations in Practice
