Definition and algorithms for reliable Steiner tree problem
From MaRDI portal
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
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 1305435 (Why is no real title available?)
- A Faster Algorithm for the Steiner Tree Problem
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- Algorithms and Data Structures
- An 11/6-approximation algorithm for the network Steiner problem
- An improved LP-based approximation for Steiner tree
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
- Fourier meets M\"{o}bius: fast subset convolution
- Improved Approximations for the Steiner Tree Problem
- New approximation algorithms for the Steiner tree problems
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
- RNC-approximation algorithms for the steiner problem
- Reducibility among combinatorial problems
- The steiner problem in graphs
- Tighter Bounds for Graph Steiner Tree Approximation
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)
