A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting

A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting

We present the first polynomial-time approximation scheme (PTAS), i.e., (1+ε)-approximation algorithm for any constant ε> 0, for the planar group Steiner tree problem (in which each group lies on a boundary of a face). This result improves on the best previous approximation factor of O(logn (logl...

Full description

Bibliographic Details
Main Authors: Bateni, MohammadHossein, Hajiaghayi, MohammadTaghi, Marx, Dániel, Demaine, Erik D
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Association for Computing Machinery (ACM) 2018
Online Access:http://hdl.handle.net/1721.1/115309
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/115309
https://orcid.org/0000-0003-3803-5703

Similar Items