Contraction-based Steiner tree approximations in practice

DOI10.1007/978-3-642-25591-5_6MaRDI QIDQ3104598zbMATH OpenOpenAlexFDO

Authors Markus Chimani, Matthias Woste

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

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Strong Steiner tree approximations in practice
• scientific article; zbMATH DE number 139919
• An improved LP-based approximation for Steiner tree
• New approximation algorithms for the Steiner tree problems
• scientific article; zbMATH DE number 1445376

Cited in

(7)

• 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
• Strong Steiner tree approximations in practice
• On Hop-Constrained Steiner Trees in Tree-Like Metrics
• Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
• Solving Steiner trees: Recent advances, challenges, and perspectives

This page was built for publication: Contraction-based Steiner tree approximations in practice

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