Paper by Erik D. Demaine

Reference:

MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx, “A PTAS for Planar Group Steiner Tree via Spanner Bootstrapping and Prize Collecting”, in Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC 2016), Cambridge, Massachusetts, 2016, pages 570–583.

Comments:

The paper is also available from the ACM Digital Library.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]