An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem

TL;DR

This paper introduces an optimal algorithm for constructing a Steiner tree with minimal longest edge length, where Steiner vertices are from a specific set, improving efficiency over previous methods.

Contribution

The paper presents a new algorithm that computes the Euclidean Bottleneck Full Steiner Tree in optimal time, matching the lower bound in the algebraic computation tree model.

Findings

Algorithm runs in O((n+m) log m) time, improving previous results.

Proves a matching lower bound in the algebraic computation tree model.

Provides a more efficient solution for the Steiner tree problem with constraints.

Abstract

Let $P$ and $S$ be two disjoint sets of $n$ and $m$ points in the plane, respectively. We consider the problem of computing a Steiner tree whose Steiner vertices belong to $S$, in which each point of $P$ is a leaf, and whose longest edge length is minimum. We present an algorithm that computes such a tree in $O((n+m)\log m)$ time, improving the previously best result by a logarithmic factor. We also prove a matching lower bound in the algebraic computation tree model.