AG 1, AG 2, AG 3, INET, AG 4, AG 5, D6, SWS, RG1, MMCI   Info

AG Audience

English

30 Minutes

"Constrained Forest Problems (CFPs) as introduced by Goemans and Williamson in 1995 capture a wide range of network design problems with edge subsets as solutions, such as Minimum Spanning Tree, Steiner Forest, and Point-to-Point Connection. While individual CFPs have been studied extensively in individual computational models, a unified approach to solving general CFPs in multiple computational models has been lacking. Against this background, we present the shell-decomposition algorithm, a model-agnostic meta-algorithm that efficiently computes a (2+ϵ)-approximation to CFPs for a broad class of forest functions. To demonstrate the power and flexibility of this result, we instantiate our algorithm for 3 fundamental, NP-hard CFPs (Steiner Forest, Point-to-Point Connection, and Facility Placement and Connection) in 3 different computational models (Congest, PRAM, and Multi-Pass Streaming). For example, for constant ϵ, we obtain the following (2+ϵ)-approximations in the Congest model:

1. For Steiner Forest specified via input components, where each node knows the identifier of one of k disjoint subsets of V (the input components), we achieve a deterministic (2+ϵ)-approximation in Õ(√n+D+k) rounds, where D is the hop diameter of the graph.
2. For Steiner Forest specified via symmetric connection requests, where connection requests are issued to pairs of nodes, we leverage randomized equality testing to reduce the running time to Õ(√n+D), succeeding with high probability.
3. For Point-to-Point Connection, we provide a (2+ϵ)-approximation in Õ(√n+D) rounds.
4. For Facility Placement and Connection, a relative of non-metric Uncapacitated Facility Location, we obtain a (2+ϵ)-approximation in O(√n+D) rounds.

We further show how to replace the √n+D term by the complexity of solving Partwise Aggregation, achieving (near-)universal optimality in any setting in which a solution to Partwise Aggregation in near-shortcut-quality time is known."

Ina Geisler

+49 681 9325 1802

--email hidden

Zoom

passcode not visible

logged in users only