Breaking the Barrier: A Polynomial-Time Polylogarithmic Approximation for Directed Steiner Tree

2024-12-14

arXiv.org

AI Summary

This work addresses the Directed Steiner Tree (DST) problem—connecting a root to $k$ terminals in a directed graph at minimum cost—a classic NP-hard problem. Prior polynomial-time algorithms achieved only $k^varepsilon$-approximations for any $varepsilon > 0$, a long-standing barrier. We present the first polynomial-time algorithm achieving an $O(log^3 k)$-approximation, substantially improving upon all prior polynomial-time results and approaching the best-known quasipolynomial-time bound of $O(log^2 k / log log k)$. Our approach integrates hierarchical graph decomposition, randomized rounding, dynamic programming, and recursive contraction—combining combinatorial optimization techniques to ensure both theoretical guarantees and computational tractability on arbitrary directed graphs. This resolves a central open problem in DST approximation, bridging a significant gap between polynomial-time and quasipolynomial-time approximability.

Technology Category

• Search and Optimization: Combinatorial Optimization
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

The Directed Steiner Tree (DST) problem is defined on a directed graph $G=(V,E)$, where we are given a designated root vertex $r$ and a set of $k$ terminals $K subseteq V setminus {r}$. The goal is to find a minimum-cost subgraph that provides directed $r ightarrow t$ paths for all terminals $t in K$. The approximability of DST has long been a central open problem in network design. Although there exist polylogarithmic-approximation algorithms with quasi-polynomial running times (Charikar et al. 1998; Grandoni, Laekhanukit, and Li 2019; Ghuge and Nagarajan 2020), the best-known polynomial-time approximation until now has remained at $k^epsilon$ for any constant $epsilon>0$. Whether a polynomial-time algorithm achieving a polylogarithmic approximation exists has been a longstanding mystery. In this paper, we resolve this question by presenting a polynomial-time algorithm that achieves an $O(log^3 k)$-approximation for DST on arbitrary directed graphs. This result nearly matches the state-of-the-art $O(log^2 k / loglog k)$ approximations known only via quasi-polynomial-time algorithms. The resulting gap -- $O(log^3 k)$ versus $O(log^2 k / loglog k)$ -- mirrors the known complexity landscape for the Group Steiner Tree problem. This parallel suggests intriguing new directions: Is there a hardness result that provably separates the power of polynomial-time and quasi-polynomial-time algorithms for DST?

Problem

• Addressing the integrality gap of Directed Steiner Tree LP relaxations
• Providing polylogarithmic approximation for Directed Steiner Tree problem
• Developing flow-based LP relaxation with relative integral solutions

Innovation

• Flow-based LP-relaxation with polylogarithmic integrality gap
• Relatively integral solutions with full or zero flow
• Randomized polynomial-time O(log³ k) approximation algorithm