A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
نویسندگان
چکیده
We demonstrate that the integrality gap of the natural cut-based LP relaxation for the directed Steiner tree problem is O(log k) in quasi-bipartite graphs with k terminals. Such instances can be seen to generalize set cover, so the integrality gap analysis is tight up to a constant factor. A novel aspect of our approach is that we use the primal-dual method; a technique that is rarely used in designing approximation algorithms for network design problems in directed graphs. 1998 ACM Subject Classification G.1.6 Optimization, G.2.2 Graph Theory, I.1.2 Artificial Intelligence
منابع مشابه
On The Integrality Gap of Directed Steiner Tree Problem
In the Directed Steiner Tree problem, we are given a directed graph G = (V,E) with edge costs, a root vertex r ∈ V , and a terminal set X ⊆ V . The goal is to find the cheapest subset of edges that contains an r-t path for every terminal t ∈ X. The only known polylogarithmic approximations for Directed Steiner Tree run in quasi-polynomial time and the best polynomial time approximations only ac...
متن کاملOn the Bidirected Cut Relaxation for the Metric Steiner Tree Problem (extended Abstract)
We give the rst algorithmic result using the bidi-rected cut relaxation for the metric Steiner tree problem: a 3=2+ factor approximation algorithm, for any > 0, for the special case of quasi-bipartite graphs; these are graphs that do not have edges connecting pairs of Steiner vertices. This relaxation is conjectured to have integrality gap close to 1; the worst example known has integrality gap...
متن کاملNew Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Determining the integrality gap of the bi-directed cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. We use geometry to define an LP whose dual is equivalent to this relaxation. This opens up the possibility of using the primal-dual schema in a geometric setting for designing an algorithm for this problem. Using this approach...
متن کاملDirected Steiner Tree and the Lasserre Hierarchy
The goal for the DIRECTED STEINER TREE problem is to find a minimum cost tree in a directed graph G = (V ,E ) that connects all terminals X to a given root r . It is well known that modulo a logarithmic factor it suffices to consider acyclic graphs where the nodes are arranged in l ≤ log |X | levels. Unfortunately the natural LP formulation has a Ω( p |X |) integrality gap already for 5 levels....
متن کاملLinear Programming Hierarchies Suffice for Directed Steiner Tree
We demonstrate that ` rounds of the Sherali-Adams hierarchy and 2` rounds of the Lovász-Schrijver hierarchy suffice to reduce the integrality gap of a natural LP relaxation for Directed Steiner Tree in `-layered graphs from Ω( √ k) to O(` · log k) where k is the number of terminals. This is an improvement over Rothvoss’ result that 2` rounds of the considerably stronger Lasserre SDP hierarchy r...
متن کامل