Frank K. Hwang

Steiner tree problems

We give a survey up to 1989 on the Steiner tree problems which include the four important cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We also provide a rather comprehensive and up-to-date bibliography which covers more than three hundred items.

On Steiner Minimal Trees with Rectilinear Distance

We consider Steiner minimal trees in the plane with rectilinear distance. The rectilinear distance

A proof of the Gilbert-Pollak conjecture on the Steiner ratio

d(p_1 ,p_2 )

A linear time algorithm for full steiner trees

between two points

A Lower Bound for the Steiner Tree Problem

p_1

Diameters of weighted double loop networks

,

The Hamiltonian property of generalized de Bruijn digraphs

p_2

A new bound for the Steiner ratio

is

Double loop networks with minimum delay

| {x_1 - x_2 } | + | {y_1 - y_2 } |

The shortest network under a given topology

, where the