Optimal and approximate bottleneck Steiner trees

@article{Ganley1996OptimalAA,
  title={Optimal and approximate bottleneck Steiner trees},
  author={Joseph L. Ganley and Jeffrey S. Salowe},
  journal={Oper. Res. Lett.},
  year={1996},
  volume={19},
  pages={217-224}
}
Given a set of terminals in the plane, a bottleneck Steiner tree is a tree interconnecting the terminals, in which the length of the longest edge is minimized. The bottleneck Steiner tree problem, or special cases thereof, has applications in facility location and electronic physical design automation. In this paper, we first consider algorithms for computing optimal bottleneck Steiner trees. For a given topology, we give a direct, geometric algorithm that computes an optimal rectilinear… CONTINUE READING
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

On exact solutions to the Euclidean bottleneck Steiner tree problem

  • Inf. Process. Lett.
  • 2010
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Exact Algorithms for the Bottleneck Steiner Tree Problem

VIEW 18 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Geometric interconnection and placement algorithms

VIEW 17 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

On Approximation of the Power-p and Bottleneck Steiner Trees

VIEW 11 EXCERPTS
CITES RESULTS, METHODS & BACKGROUND
HIGHLY INFLUENCED

Best and worst-case coverage problems for arbitrary paths in wireless sensor networks

  • The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010)
  • 2010
VIEW 1 EXCERPT
CITES METHODS

Similar Papers

Loading similar papers…