Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane

The Steiner problem with edge lengths 1 and 2

Marshall Bern, Paul E. Plassmann · Information Processing Letters · 1989 · 378 citations

Computing, Computer Science, Mathematics +13

An augmenting path algorithm for linear matroid parity

Harold N. Gabow, Matthias F. Stallmann · COMBINATORICA · 1986 · 68 citations

Computing, Computer Science, Algorithms +8

Approximations for a Bottleneck Steiner Tree Problem

Lusheng Wang, Zhaodong Du · Algorithmica · 2002 · 46 citations

Computing, Computer Science, Optimization +9

An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane

Lusheng Wang, Zimao Li · Information Processing Letters · 2002 · 33 citations

Computing, Computer Science, Algorithms +11