Computing a Rectilinear Steiner Minimal Tree in nO(sqrt(n)) Time

Abstract

We propose an algorithm for computing a rectilinear Steiner minimal tree on n points in 2 °('/7'l°gN time and O(n 2) space. This is an asymptotic improvement on the 2 °(") tirae required by current algorithms. If the points are distributed uniformly at random on the unit square, the Steiner tree calculated by our algorithm is minimal with high probability… (More)
DOI: 10.1007/3-540-18099-0_44

Topics

7 Figures and Tables

Cite this paper

@inproceedings{Thomborson1987ComputingAR, title={Computing a Rectilinear Steiner Minimal Tree in nO(sqrt(n)) Time}, author={Clark D. Thomborson and Linda L. Deneen and Gary M. Shute}, booktitle={Parallel Algorithms and Architectures}, year={1987} }