On the approximability of robust spanning tree problems.

Adam Kasperski Pawel Zielinski

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

Keyphrases

spanning tree
minimum weight
optimization problems
minimum cost
probabilistic model
particle swarm optimization
np complete
computationally efficient
combinatorial optimization
minimum spanning tree