An(log) approximation scheme for Steiner tree in planar graphs

Open Webpage

Glencora Borradaile, Philip N. Klein, Claire Mathieu

Published: 01 Jan 2009, Last Modified: 08 Aug 2024ACM Trans. Algorithms 2009EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We give a Polynomial-Time Approximation Scheme (PTAS) for the Steiner tree problem in planar graphs. The running time is O(n log n).