An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem

A. Karim Abu-Affash

Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) poin…