Characterization of monotonic rules in minimum cost spanning tree problems.
Gustavo BergantiñosJuan J. Vidal-PugaPublished in: Int. J. Game Theory (2015)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- np hard
- minimum cost flow
- approximation algorithms
- minimum spanning tree
- linear relaxation
- minimum weight
- np complete
- network flow
- network simplex algorithm
- minimum cost path
- capacity constraints
- undirected graph
- minimum spanning trees
- optimal solution
- edit operations
- worst case
- computational complexity