(1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
From MaRDI portal
Publication:3511368
DOI10.1007/978-3-540-69733-6_56zbMath1148.05318OpenAlexW1552177397MaRDI QIDQ3511368
Donghyun Kim, Feng Zou, Yaochun Huang, Xianyue Li, Weili Wu
Publication date: 10 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_56
Related Items
Cites Work
- The full Steiner tree problem
- Approximating the selected-internal Steiner tree
- The Steiner problem in phylogeny is NP-complete
- The Steiner tree problem
- On component-size bounded Steiner trees
- Advances in Steiner trees
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Complexity of Computing Steiner Minimal Trees
- Thek-Steiner Ratio in Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item