Steiner Forest: A Simplified Better-Than-2 Approximation

2025-11-23

AI Summary

The Steiner Forest problem seeks a minimum-weight subgraph of a weighted graph that connects all given terminal pairs. For decades, the best-known polynomial-time approximation ratio remained 2. This paper introduces a novel, unified abstraction framework that integrates an extended moat-growing primal-dual algorithm, submodular function maximization for selecting contractible components, autarkic pair and triple identification techniques, and a relative greedy strategy. Our approach breaks the long-standing theoretical barrier, improving the approximation ratio from 2 to 1.994—surpassing the prior best ratio of $2 - varepsilon$ (where $varepsilon approx 10^{-11}$). The framework yields a more scalable and analytically transparent algorithm, with significantly simplified proof structure and broader applicability to related network design problems.

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: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Search and Retrieval-Augmented AI: Efficiency and scalability of Web search engines

Abstract

In the Steiner Forest problem, we are given a graph with edge lengths, and a collection of demand pairs; the goal is to find a subgraph of least total length such that each demand pair is connected in this subgraph. For over twenty years, the best approximation ratio known for the problem was a $2$-approximation due to Agrawal, Klein, and Ravi (STOC 1991), despite many attempts to surpass this bound. Finally, in a recent breakthrough, Ahmadi, Gholami, Hajiaghayi, Jabbarzade, and Mahdavi (FOCS 2025) gave a $2-varepsilon$-approximation, where $varepsilon approx 10^{-11}$. In this work, we show how to simplify and extend the work of Ahmadi et al. to obtain an improved $1.994$-approximation. We combine some ideas from their work (e.g., an extended run of the moat-growing primal-dual algorithm, and identifying autarkic pairs) with other ideas -- submodular maximization to find components to contract, as in the relative greedy algorithms for Steiner tree, and the use of autarkic triples. We hope that our cleaner abstraction will open the way for further improvements.

Problem

• Improving approximation ratio for Steiner Forest problem
• Simplifying prior breakthrough algorithm for better results
• Developing cleaner abstraction for future algorithmic improvements

Innovation

• Simplified extended moat-growing primal-dual algorithm
• Submodular maximization for component contraction
• Autarkic pairs and triples identification technique