Authors
Glencora Borradaile, Philip Klein, Claire Mathieu
Publication date
2009/7/4
Journal
ACM Transactions on Algorithms (TALG)
Volume
5
Issue
3
Pages
1-31
Publisher
ACM
Description
We give a Polynomial-Time Approximation Scheme (PTAS) for the Steiner tree problem in planar graphs. The running time is O(n log n).
Total citations
2008200920102011201220132014201520162017201820192020202120222023202485111210198155714716121082
Scholar articles
G Borradaile, P Klein, C Mathieu - ACM Transactions on Algorithms (TALG), 2009
G Borradaile, P Klein, C Mathieu, O An - ACM Transactions on Algorithms. v5 i3