Optimal and approximate bottleneck Steiner trees

DOI10.1016/S0167-6377(96)00028-4zbMath0874.90113WikidataQ126376883 ScholiaQ126376883MaRDI QIDQ1362990

Joseph L. Ganley, Jeffrey S. Salowe

Publication date: 7 August 1997

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

geometric algorithmsfacility locationbottleneck Steiner treeminmax multicenter

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Discrete location and assignment (90B80)

Related Items (6)

Exact algorithms for the bottleneck Steiner tree problem ⋮ A catalog of Hanan grid problems ⋮ Generalised \(k\)-Steiner tree problems in normed planes ⋮ On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem ⋮ On exact solutions to the Euclidean bottleneck Steiner tree problem ⋮ The stochastic bottleneck linear programming problem

Cites Work

• Unnamed Item
• Unnamed Item
• Layout of facilities with some fixed points
• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES
• Combinatorial Optimization with Rational Objective Functions
• Bottleneck Steiner trees in the plane
• On Steiner’s Problem with Rectilinear Distance

This page was built for publication: Optimal and approximate bottleneck Steiner trees