Approximations for a bottleneck Steiner tree problem

DOI10.1007/s00453-001-0089-4zbMath1004.68126OpenAlexW2171603211MaRDI QIDQ1348905

Lusheng Wang, Ding-Zhu Du

Publication date: 21 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0089-4

zbMATH Keywords

wireless communication networks

Mathematics Subject Classification ID

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

Related Items

The approximability of three-dimensional assignment problems with bottleneck objective ⋮ Fixed parameter tractability of a biconnected bottleneck Steiner network problem ⋮ Simplifying obstacles for Steiner network problems in the plane ⋮ The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) ⋮ Survivable minimum bottleneck networks ⋮ Optimal relay location for resource-limited energy-efficient wireless communication ⋮ An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes ⋮ The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition ⋮ Exact algorithms for the bottleneck Steiner tree problem ⋮ Bottleneck Steiner tree with bounded number of Steiner vertices ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem ⋮ On exact solutions to the Euclidean bottleneck Steiner tree problem ⋮ An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane

This page was built for publication: Approximations for a bottleneck Steiner tree problem