From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs

TL;DR

This work advances approximation algorithms for rooted network-design problems in directed planar graphs, focusing on $DST$ and its generalizations $DGST$, $DCST$, and $DPST$. It introduces a recursive tree-embedding framework that converts planar digraph instances into tree-like structures, enabling polynomial-time poly-logarithmic approximations and enabling LP-based guarantees. The paper establishes an $O(\log^2 k)$ integrality gap for the standard cut-based LP in planar graphs and extends these ideas to multi-rooted variants via density-based arguments, achieving poly-log approximations in planar digraphs. Together, these results bridge gaps between directed and undirected Steiner-type problems in planar graphs and provide practical tools for a broad family of rooted network-design problems.

Abstract

In the Directed Steiner Tree (DST) problem the input is a directed edge-weighted graph $G=(V,E)$, a root vertex $r$ and a set $S \subseteq V$ of $k$ terminals. The goal is to find a min-cost subgraph that connects $r$ to each of the terminals. DST admits an $O(\log^2 k/\log \log k)$-approximation in quasi-polynomial time, and an $O(k^ε)$-approximation for any fixed $ε> 0$ in polynomial-time. Resolving the existence of a polynomial-time poly-logarithmic approximation is a major open problem in approximation algorithms. In a recent work, Friggstad and Mousavi [ICALP 2023] obtained a simple and elegant polynomial-time $O(\log k)$-approximation for DST in planar digraphs via Thorup's shortest path separator theorem. We build on their work and obtain several new results on DST and related problems. - We develop a tree embedding technique for rooted problems in planar digraphs via an interpretation of the recursion in Friggstad and Mousavi [ICALP 2023]. Using this we obtain polynomial-time poly-logarithmic approximations for Group Steiner Tree, Covering Steiner Tree, and the Polymatroid Steiner Tree problems in planar digraphs. All these problems are hard to approximate to within a factor of $Ω(\log^2 n/\log \log n)$ even in trees. - We prove that the natural cut-based LP relaxation for DST has an integrality gap of $O(\log^2 k)$ in planar graphs. This is in contrast to general graphs where the integrality gap of this LP is known to be $Ω(k)$ and $Ω(n^δ)$ for some fixed $δ> 0$. - We combine the preceding results with density based arguments to obtain poly-logarithmic approximations for the multi-rooted versions of the problems in planar digraphs. For DST our result improves the $O(R + \log k)$ approximation of Friggstad and Mousavi [ICALP 2023] when $R= ω(\log^2 k)$.

Figures (1)

• Figure 1: The tree $\mathcal{T}$ given by $\textsc{TreeEmb}$, where $t_1, t_2$ are terminals in $P$.

Theorems & Definitions (36)

• theorem 1
• theorem 2
• theorem 3
• remark 1
• remark 2
• lemma 4: FriggstadM23Thorup04
• theorem 5
• definition 1
• remark 3
• theorem 6: ZosinK02