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

Yair Bartal; Lee Ad Gottlieb

doi:10.1145/3406325.3451063

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

Yair Bartal, Lee Ad Gottlieb

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

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 language	English
Title of host publication	STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Editors	Samir Khuller, Virginia Vassilevska Williams
Publisher	Association for Computing Machinery
Pages	1028-1041
Number of pages	14
ISBN (Electronic)	9781450380539
DOIs	https://doi.org/10.1145/3406325.3451063
State	Published - 15 Jun 2021
Event	53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 - Virtual, Online, Italy Duration: 21 Jun 2021 → 25 Jun 2021

Publication series

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

Conference

Conference	53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021
Country/Territory	Italy
City	Virtual, Online
Period	21/06/21 → 25/06/21

Bibliographical note

Publisher Copyright:
© 2021 ACM.

Keywords

Steiner forest
banyans
doubling dimension

Access to Document

10.1145/3406325.3451063

Cite this

Bartal, Y., & Gottlieb, L. A. (2021). Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. In S. Khuller, & V. V. Williams (Eds.), STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (pp. 1028-1041). (Proceedings of the Annual ACM Symposium on Theory of Computing). Association for Computing Machinery. https://doi.org/10.1145/3406325.3451063

Bartal, Yair ; Gottlieb, Lee Ad. / Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. editor / Samir Khuller ; Virginia Vassilevska Williams. Association for Computing Machinery, 2021. pp. 1028-1041 (Proceedings of the Annual ACM Symposium on Theory of Computing).

@inproceedings{bf3e9b1685364c438b5bc0259f2f3f62,

title = "Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces",

abstract = "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).",

keywords = "Steiner forest, banyans, doubling dimension",

author = "Yair Bartal and Gottlieb, {Lee Ad}",

note = "Publisher Copyright: {\textcopyright} 2021 ACM.; 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 ; Conference date: 21-06-2021 Through 25-06-2021",

year = "2021",

month = jun,

day = "15",

doi = "10.1145/3406325.3451063",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "1028--1041",

editor = "Samir Khuller and Williams, {Virginia Vassilevska}",

booktitle = "STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing",

}

Bartal, Y & Gottlieb, LA 2021, Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. in S Khuller & VV Williams (eds), STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 1028-1041, 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, Virtual, Online, Italy, 21/06/21. https://doi.org/10.1145/3406325.3451063

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. / Bartal, Yair; Gottlieb, Lee Ad.
STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. ed. / Samir Khuller; Virginia Vassilevska Williams. Association for Computing Machinery, 2021. p. 1028-1041 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Bartal, Yair

AU - Gottlieb, Lee Ad

PY - 2021/6/15

Y1 - 2021/6/15

N2 - 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).

AB - 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).

KW - Steiner forest

KW - banyans

KW - doubling dimension

UR - http://www.scopus.com/inward/record.url?scp=85108175187&partnerID=8YFLogxK

U2 - 10.1145/3406325.3451063

DO - 10.1145/3406325.3451063

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85108175187

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 1028

EP - 1041

BT - STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

A2 - Khuller, Samir

A2 - Williams, Virginia Vassilevska

PB - Association for Computing Machinery

T2 - 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021

Y2 - 21 June 2021 through 25 June 2021

ER -

Bartal Y, Gottlieb LA. Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. In Khuller S, Williams VV, editors, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery. 2021. p. 1028-1041. (Proceedings of the Annual ACM Symposium on Theory of Computing). doi: 10.1145/3406325.3451063

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

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this