Definition and algorithms for reliable Steiner tree problem
From MaRDI portal
Publication:498083
DOI10.1007/S11424-014-2120-2zbMATH Open1321.05277OpenAlexW2044301172MaRDI QIDQ498083FDOQ498083
Authors: Yaohua Tang, Wenguo Yang, Tiande 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
Recommendations
- On the full and bottleneck full Steiner tree problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- A faster approximation algorithm for the Steiner problem in graphs
- New approximation algorithm for minimum Steiner tree problem
- scientific article; zbMATH DE number 139910
Cites Work
- Reducibility among Combinatorial Problems
- New approximation algorithms for the Steiner tree problems
- An 11/6-approximation algorithm for the network Steiner problem
- Improved Approximations for the Steiner Tree Problem
- Tighter Bounds for Graph Steiner Tree Approximation
- An improved LP-based approximation for Steiner tree
- Fourier meets M\"{o}bius: fast subset convolution
- Title not available (Why is that?)
- The steiner problem in graphs
- Title not available (Why is that?)
- A Faster Algorithm for the Steiner Tree Problem
- Algorithms and Data Structures
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- RNC-approximation algorithms for the steiner problem
This page was built for publication: Definition and algorithms for reliable Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498083)
