Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces

Yair Bartal, Lee Ad Gottlieb

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


We give an algorithm that computes a (1+?)-approximate Steiner forest in near-linear time n · 2(1/?)O(ddim2) (loglogn)2, where ddim is the doubling dimension of the metric space. This improves upon the best previous result due to Chan et al. (SIAM J. Comput. 4 (2018)), who gave a runtime of about n2O(ddim) · 2(ddim/?)O(ddim) ?logn. For Steiner tree our methods achieve an even better runtime n (logn)(1/?)O(ddim2).

Original languageAmerican English
Title of host publicationSTOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
EditorsSamir Khuller, Virginia Vassilevska Williams
PublisherAssociation for Computing Machinery
Number of pages14
ISBN (Electronic)9781450380539
StatePublished - 15 Jun 2021
Event53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 - Virtual, Online, Italy
Duration: 21 Jun 202125 Jun 2021

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017


Conference53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021
CityVirtual, Online

Bibliographical note

Publisher Copyright:
© 2021 ACM.


  • Steiner forest
  • banyans
  • doubling dimension

Cite this