A Local-Search Algorithm for Steiner Forest


In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connected. The problem is APX-Hard and can be 2-approximated by, e.g., the elegant primal-dual algorithm of Agrawal, Klein, and Ravi from 1995. We give a local-search-based constant… (More)
DOI: 10.4230/LIPIcs.ITCS.2018.31


20 Figures and Tables

Slides referencing similar topics