On the Full and Bottleneck Full Steiner Tree Problems
From MaRDI portal
Publication:3082919
DOI10.1007/3-540-45071-8_14zbMath1276.68132OpenAlexW1595291551MaRDI QIDQ3082919
Chin Lung Lu, Yen Hung Chen, Chuan Yi Tang
Publication date: 18 March 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45071-8_14
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (12)
On some network design problems with degree constraints ⋮ A polylogarithmic approximation for computing non-metric terminal Steiner trees ⋮ An Efficient Approximation Algorithm for the Steiner Tree Problem ⋮ Algorithms for the minimum diameter terminal Steiner tree problem ⋮ On the hardness of full Steiner tree problems ⋮ Algorithms for terminal Steiner trees ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ The minimum evolution problem: Overview and classification ⋮ On approximation algorithms for the terminal Steiner tree problem ⋮ On the Clustered Steiner Tree Problem ⋮ On full Steiner trees in unit disk graphs ⋮ On the clustered Steiner tree problem
This page was built for publication: On the Full and Bottleneck Full Steiner Tree Problems