An optimal algorithm for the Euclidean bottleneck full Steiner tree problem

DOI10.1016/j.comgeo.2013.10.001zbMath1280.05064arXiv1305.0172OpenAlexW2068598660MaRDI QIDQ390152

Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.0172

zbMATH Keywords

minimum spanning treeSteiner treebottleneck lengthYao graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (4)

Bottleneck bichromatic full Steiner trees ⋮ Faster bottleneck non-crossing matchings of points in convex position ⋮ On the hardness of full Steiner tree problems ⋮ The balanced connected subgraph problem

This page was built for publication: An optimal algorithm for the Euclidean bottleneck full Steiner tree problem