Streaming Algorithms for Geometric Steiner Forest

Abstract

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.