A note on the terminal Steiner tree problem
From MaRDI portal
Publication:1014425
DOI10.1016/S0020-0190(03)00285-0zbMath1161.68667MaRDI QIDQ1014425
Publication date: 28 April 2009
Published in: Information Processing Letters (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Related Items
A polylogarithmic approximation for computing non-metric terminal Steiner trees, The minimum spanning tree problem with non-terminal set, A better constant-factor approximation for selected-internal Steiner minimum tree, Heuristics for automated knowledge source integration and service composition, Minimum diameter cost-constrained Steiner trees, Algorithms for terminal Steiner trees, On the Clustered Steiner Tree Problem, DIAMETER-CONSTRAINED STEINER TREES
Cites Work