Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree.

Fabrizio Grandoni Bundit Laekhanukit

Published in: CoRR (2016)

Keyphrases

directed graph
steiner tree
random walk
undirected graph
minimum spanning tree
strongly connected
shortest path
directed acyclic graph
disjoint paths
connected components
graph structure
approximation algorithms
evolutionary algorithm
knapsack problem
linear programming relaxation
facility location