MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "An O(n log n) approximation scheme for Steiner tree in planar graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

An O(n log n) Approximation Scheme for Steiner Tree in Planar Graphs
by Glencora Borradaile, Philip N. Klein, Claire Mathieu — 2007
…An O(n log n) Approximation Scheme for Steiner Tree in Planar Graphs Glencora Borradaile…
Add To MetaCart

A polynomial-time approximation scheme for Steiner tree in planar graphs
by Glencora Borradaile, Claire Kenyon-mathieu, Philip Klein — 2007 — In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms
… Borradaile ∗† Claire Kenyon-Mathieu † Philip Klein ‡† We give an O(n log n) approximation scheme for Steiner…
Cited by 7 (4 self) – Add To MetaCart

Steiner tree in planar graphs: An O(n log n) approximation scheme with singly exponential
by Glencora Borradaile, Philip N. Klein — 2007 — Proc. 10th Ann. Workshop on Algorithms and Data Structures
…Steiner Tree in Planar Graphs: An O(n log n) Approximation Scheme with Singly…
Cited by 5 (2 self) – Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB