Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

An O(n log n) Approximation Scheme for Steiner Tree in Planar Graphs

Author:
Borradaile, Glencora  Klein, Philip  Mathieu, Claire  


Journal:
ACM TRANSACTIONS ON ALGORITHMS


Issue Date:
2009


Abstract(summary):

We give a Polynomial-Time Approximation Scheme (PTAS) for the Steiner tree problem in planar graphs. The running time is O(n log n).


Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads