Approximating Directed Steiner Problems via Tree Embedding

international colloquium on automata languages and programming, pp. 74:1-74:13, 2016.

Cited by: 7|Bibtex|Views1|Links
EI

Abstract:

Directed Steiner problems are fundamental problems in Combinatorial Optimization and Theoretical Computer Science. An important problem in this genre is the k-edge connected directed Steiner tree (k-DST) problem. In this problem, we are given a directed graph G on n vertices with edge-costs, a root vertex r, a set of h terminals T and an ...More

Code:

Data:

Your rating :
0

 

Tags
Comments