Streaming Algorithms for Geometric Steiner Forest Article Swipe

MAKE IMPACT

Artur Czumaj , Shaofeng H.-C. Jiang , Robert Krauthgamer , Pavel Veselý · YOU? · · 2024 · Open Access · · DOI: https://doi.org/10.1145/3663666

We consider a generalization of the Steiner tree problem, the Steiner forest problem , in the Euclidean plane: the input is a multiset \(X\subseteq{\mathbb{R}}^{2}\) , partitioned into \(k\) color classes \(C_{1},\ldots,C_{k}\subseteq X\) . The goal is to find a minimum-cost Euclidean graph \(G\) such that every color class \(C_{i}\) is connected in \(G\) . We study this Steiner forest problem in the streaming setting, where the stream consists of insertions and deletions of points to \(X\) . Each input point \(x {\in} X\) arrives with its color \(\mathsf{color}(x) {\in} [k]\) , and as usual for dynamic geometric streams, the input is restricted to the discrete grid \(\{1,\ldots,\Delta\}^{2}\) . We design a single-pass streaming algorithm that uses \(\operatorname{poly}(k\cdot\log\Delta)\) space and time, and estimates the cost of an optimal Steiner forest solution within ratio arbitrarily close to the famous Euclidean Steiner ratio \(\alpha_{2}\) (currently \(1.1547\leq\alpha_{2}\leq 1.214\) ). This approximation guarantee matches the state-of-the-art bound for streaming Steiner tree, i.e., when \(k=1\) , and it is a major open question to improve the ratio to \(1+\varepsilon\) even for this special case. Our approach relies on a novel combination of streaming techniques, like sampling and linear sketching, with the classical Arora-style dynamic-programming framework for geometric optimization problems, which usually requires large memory and so far has not been applied in the streaming setting. We complement our streaming algorithm for the Steiner forest problem with simple arguments showing that any finite multiplicative approximation requires \(\Omega(k)\) bits of space.

Type

article

Language

en

Landing Page

https://doi.org/10.1145/3663666

PDF

https://dl.acm.org/doi/pdf/10.1145/3663666

OA Status

bronze

Cited By

1

References

69

Related Works

10

OpenAlex ID

https://openalex.org/W3103329032

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W3103329032

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.1145/3663666

Digital Object Identifier

Title

Streaming Algorithms for Geometric Steiner Forest

Work title

Type

article

OpenAlex work type

Language

en

Primary language

Publication year

2024

Year of publication

Publication date

2024-05-07

Full publication date if available

Authors

Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý

List of authors in order

Landing page

https://doi.org/10.1145/3663666

Publisher landing page

PDF URL

https://dl.acm.org/doi/pdf/10.1145/3663666

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

bronze

Open access status per OpenAlex

OA URL

https://dl.acm.org/doi/pdf/10.1145/3663666

Direct OA link when available

Concepts

Steiner tree problem, Combinatorics, Mathematics, Euclidean geometry, Amortized analysis, Discrete mathematics, Data structure, Computer science, Geometry, Programming language

Top concepts (fields/topics) attached by OpenAlex

Cited by

1

Total citation count in OpenAlex

Citations by year (recent)

2022: 1

Per-year citation counts (last 5 years)

References (count)

69

Number of works referenced by this work

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload