Approximations for a bottleneck Steiner tree problem

DOI10.1007/S00453-001-0089-4MaRDI QIDQ1348905zbMATH OpenOpenAlexFDO

Authors Lusheng Wang, Du Ding-Zhu

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)

Recommendations

• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• On the Euclidean bottleneck full Steiner tree problem
• Optimal and approximate bottleneck Steiner trees
• Approximations for Steiner trees with minimum number of Steiner points
• The Euclidean bottleneck full Steiner tree problem

Cited in

(21)

• The Euclidean bottleneck full Steiner tree problem
• Survivable minimum bottleneck networks
• An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
• Computational Science and Its Applications – ICCSA 2004
• The bottleneck selected‐internal and partial terminal Steiner tree problems
• The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
• Bottleneck Steiner tree with bounded number of Steiner vertices
• Fixed parameter tractability of a biconnected bottleneck Steiner network problem
• Optimal relay location for resource-limited energy-efficient wireless communication
• Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
• scientific article; zbMATH DE number 1424548 (Why is no real title available?)
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• scientific article; zbMATH DE number 1688388 (Why is no real title available?)
• An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes
• The approximability of three-dimensional assignment problems with bottleneck objective
• Simplifying obstacles for Steiner network problems in the plane
• Exact algorithms for the bottleneck Steiner tree problem
• Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)
• On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348905)