Login / Signup
Fast approximation of steiner trees in large graphs.
Andrey Gubichev
Thomas Neumann
Published in:
CIKM (2012)
Keyphrases
</>
steiner tree
minimum spanning tree
shortest path
weighted graph
linear programming relaxation
graph theory
approximation algorithms
spanning tree
undirected graph
decision making
lower bound
graph structure