A polynomial-time approximation scheme for Steiner tree in planar graphs
January 4, 2007
Glencora Borradaile, Claire Kenyon-Mathieu and Philip Klein
We give an O(n log n) approximation scheme for Steiner tree in planar graphs.
Proceedings of the Symposium on Discrete Algorithms (SODA), New Orleans, Louisiana, 2007.
[ publishers link ] [ pdf ]
