Affiliation:
1. Oregon State University
2. Brown University
3. Ecole Normale Supérieure
Abstract
We give a randomized
O
(
n
polylog
n
)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ϵ > 0 and given
n
terminals in the plane with connection requests between some pairs of terminals, our scheme finds a (1 + ϵ) approximation to the minimum-length forest that connects every requested pair of terminals.
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献