A note on the terminal Steiner tree problem

DOI10.1016/S0020-0190(03)00285-0zbMath1161.68667OpenAlexW2023370539MaRDI QIDQ1014425

Bernhard Fuchs

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00285-0

zbMATH Keywords

Steiner minimum treeapproximation algorithmsterminal Steiner tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

DIAMETER-CONSTRAINED STEINER TREES ⋮ A better constant-factor approximation for selected-internal Steiner minimum tree ⋮ A polylogarithmic approximation for computing non-metric terminal Steiner trees ⋮ Minimum diameter cost-constrained Steiner trees ⋮ The minimum spanning tree problem with non-terminal set ⋮ 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 ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Algorithms for terminal Steiner trees ⋮ A multivariate analysis of the strict terminal connection problem ⋮ On the Clustered Steiner Tree Problem ⋮ On full Steiner trees in unit disk graphs

Cites Work

• Unnamed Item
• On the terminal Steiner tree problem.

This page was built for publication: A note on the terminal Steiner tree problem