Browsing Combinatorics and Optimization by Subject "lift and project methods"
Now showing items 1-1 of 1
-
On the Integrality Gap of Directed Steiner Tree Problem
(University of Waterloo, 2014-05-27)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 ...