The folk solution and Boruvka's algorithm in minimum cost spanning tree problems.
Gustavo BergantiñosJuan J. Vidal-PugaPublished in: Discret. Appl. Math. (2011)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- np hard
- minimum cost flow
- network flow
- minimum spanning tree
- undirected graph
- minimum weight
- dynamic programming
- optimal solution
- approximation algorithms
- computational complexity
- linear relaxation
- simulated annealing
- worst case
- mixed integer programming
- network simplex algorithm
- minimum spanning trees
- search space
- capacity constraints
- linear programming
- optimization problems
- special case
- cutting plane
- network design problem
- lagrangian relaxation
- probabilistic model
- exact solution
- objective function
- path planning
- minimum total cost
- np complete