)log(n)-approximation algorithm for dynamic Steiner trees.

Lélia Blin Maria Potop-Butucaru Stephane Rovedakis

Published in: Theor. Comput. Sci. (2013)

Keyphrases

worst case
objective function
search space
steiner tree
computational complexity
np hard
probabilistic model
convergence rate
optimal solution
cost function
mathematical model
constraint satisfaction
integer programming
minimum spanning tree