A characterization of Kruskal sharing rules for minimum cost spanning tree problems.
Leticia LorenzoSilvia Lorenzo-FreirePublished in: Int. J. Game Theory (2009)
Keyphrases
- minimum cost
- spanning tree
- minimum spanning tree
- network flow problem
- minimum cost flow
- np hard
- linear relaxation
- network flow
- network simplex algorithm
- minimum spanning trees
- approximation algorithms
- minimum weight
- undirected graph
- capacity constraints
- np complete
- knapsack problem
- minimum cost path
- combinatorial optimization
- optimization problems