Journal
ACM TRANSACTIONS ON ALGORITHMS
Volume 5, Issue 3, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/1541885.1541892
Keywords
Steiner tree; planar graphs; approximation scheme
Ask authors/readers for more resources
We give a Polynomial-Time Approximation Scheme (PTAS) for the Steiner tree problem in planar graphs. The running time is O(n log n).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
