Improved Approximations for the Steiner Tree Problem

@inproceedings{Berman1992ImprovedAF,
title={Improved Approximations for the Steiner Tree Problem},
author={Piotr Berman and Viswanathan Ramaiyer},
booktitle={SODA},
year={1992}
}

For a set S contained in a metric space, a Steiner tree of S is a tree that connects the points in S. Finding a minimum cost Steiner tree is an NP-hard problem in euclidean and rectilinear metrics as well as in graphs. We give an approximation algorithm and show that the worst-case ratio of the cost of our solutions to the optimal cost is better than previously known ratios in graphs, and in rectilinear metric on the plane. Our method offers a trade-off between the running time and the ratioâ€¦Â CONTINUE READING