Beyond metric embedding: approximating group steiner trees on bounded treewidth graphs

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 737-751, 2017.

Cited by: 2|Bibtex|Views20|Links
EI

Abstract:

The Group Steiner Tree (GST) problem is a classical problem in combinatorial optimization and theoretical computer science. In the Edge-Weighted Group Steiner Tree (EW-GST) problem, we are given an undirected graph G = (V, E) on n vertices with edge costs c : E → ℝ≥ 0, a source vertex s and a collection of subsets of vertices, called grou...More

Code:

Data:

Your rating :
0

 

Tags
Comments