Definition and algorithms for reliable Steiner tree problem

DOI10.1007/s11424-014-2120-2zbMath1321.05277OpenAlexW2044301172MaRDI QIDQ498083

Yaohua Tang, Wenguo Yang, Tian-de Guo

Publication date: 25 September 2015

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-014-2120-2

zbMATH Keywords

reliabilityapproximation algorithmSteiner treeexact algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
• New approximation algorithms for the Steiner tree problems
• On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
• An 11/6-approximation algorithm for the network Steiner problem
• An improved LP-based approximation for steiner tree
• Fourier meets M\"{o}bius: fast subset convolution
• Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
• A probably fast, provably optimal algorithm for rectilinear Steiner trees
• Improved Approximations for the Steiner Tree Problem
• Reducibility among Combinatorial Problems
• RNC-approximation algorithms for the steiner problem
• Tighter Bounds for Graph Steiner Tree Approximation
• Algorithms and Data Structures
• A Faster Algorithm for the Steiner Tree Problem
• The steiner problem in graphs

This page was built for publication: Definition and algorithms for reliable Steiner tree problem