A fair rule in minimum cost spanning tree problems.
Gustavo BergantiñosJuan J. Vidal-PugaPublished in: J. Econ. Theory (2007)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- minimum cost flow
- np hard
- approximation algorithms
- linear relaxation
- network flow
- minimum spanning tree
- minimum weight
- network simplex algorithm
- minimum spanning trees
- np complete
- capacity constraints
- undirected graph
- objective function
- special case
- optimization problems
- efficient solutions
- minimum cost path