(1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
From MaRDI portal
Publication:3511368
Recommendations
Cites work
- scientific article; zbMATH DE number 4191148 (Why is no real title available?)
- scientific article; zbMATH DE number 750011 (Why is no real title available?)
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- Advances in Steiner trees
- Approximating the selected-internal Steiner tree
- On component-size bounded Steiner trees
- The Complexity of Computing Steiner Minimal Trees
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Steiner problem in phylogeny is NP-complete
- The Steiner tree problem
- The full Steiner tree problem
- Thek-Steiner Ratio in Graphs
Cited in
(6)- The Clustered Selected-Internal Steiner Tree Problem
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
- On the Internal Steiner Tree Problem
- A better constant-factor approximation for selected-internal Steiner minimum tree
- Approximating the selected-internal Steiner tree
- MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees
This page was built for publication: (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511368)