A better constant-factor approximation for selected-internal Steiner minimum tree
From MaRDI portal
Publication:848949
DOI10.1007/S00453-009-9301-8zbMATH Open1187.68713OpenAlexW2143095751MaRDI QIDQ848949FDOQ848949
Authors: Xianyue Li, Feng Zou, Yaochun Huang, Donghyun Kim, Weili Wu 
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9301-8
Recommendations
Cites Work
- The Steiner problem in phylogeny is NP-complete
- Thek-Steiner Ratio in Graphs
- The Steiner tree problem
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Complexity of Computing Steiner Minimal Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On approximation algorithms for the terminal Steiner tree problem
- On the terminal Steiner tree problem.
- A note on the terminal Steiner tree problem
- Algorithms for terminal Steiner trees
- The full Steiner tree problem
- Approximating the selected-internal Steiner tree
- Title not available (Why is that?)
- On component-size bounded Steiner trees
- Title not available (Why is that?)
Cited In (7)
- (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
- On the clustered Steiner tree problem
- The Clustered Selected-Internal Steiner Tree Problem
- On the clustered Steiner tree problem
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
- Algorithms for the minimum diameter terminal Steiner tree problem
- Approximating the selected-internal Steiner tree
This page was built for publication: A better constant-factor 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 Q848949)
