Optimal and approximate bottleneck Steiner trees

DOI10.1016/S0167-6377(96)00028-4zbMATH Open0874.90113WikidataQ126376883 ScholiaQ126376883MaRDI QIDQ1362990FDOQ1362990

Joseph L. Ganley, Jeffrey S. Salowe

Publication date: 7 August 1997

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

Recommendations

• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• scientific article; zbMATH DE number 1796993
• scientific article; zbMATH DE number 1424548
• On the Euclidean bottleneck full Steiner tree problem
• On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

zbMATH Keywords

facility locationgeometric algorithmsbottleneck Steiner treeminmax multicenter

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Layout of facilities with some fixed points
• On Steiner’s Problem with Rectilinear Distance

Cited In (16)

• The bottleneck selected‐internal and partial terminal Steiner tree problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
• Title not available (Why is that?)
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
• Approximations for a bottleneck Steiner tree problem
• The stochastic bottleneck linear programming problem
• Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
• A catalog of Hanan grid problems
• Generalised \(k\)-Steiner tree problems in normed planes
• Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
• Exact algorithms for the bottleneck Steiner tree problem
• Approximating the selected-internal Steiner tree
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane

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

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