Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm.

Stefan Hougardy Jannik Silvanus Jens Vygen

Published in: CoRR (2014)

Keyphrases

goal oriented
steiner tree
objective function
cost function
dynamic programming
worst case
probabilistic model
simulated annealing
linear programming
search space
segmentation algorithm
minimum spanning tree
optimal solution
computational complexity
graph structure