Contraction-Based Steiner Tree Approximations in Practice
From MaRDI portal
Publication:3104598
DOI10.1007/978-3-642-25591-5_6zbMath1329.68286MaRDI 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
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
05C22: Signed and weighted graphs
Related Items
Strong Steiner Tree Approximations in Practice, Solving Steiner trees: Recent advances, challenges, and perspectives, Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View, A practical greedy approximation for the directed Steiner tree problem, A Practical Greedy Approximation for the Directed Steiner Tree Problem, The Influence of Preprocessing on Steiner Tree Approximations