Login / Signup
A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees
Lélia Blin
Maria Gradinariu Potop-Butucaru
Stephane Rovedakis
Published in:
CoRR (2009)
Keyphrases
</>
worst case
computational complexity
cost function
dynamic programming
particle swarm optimization
np hard
graph structure
bayesian networks
search space
special case
ant colony optimization
mathematical model
approximation algorithms
minimum spanning tree