On obligation rules for minimum cost spanning tree problems.
Gustavo BergantiñosAnirban KarPublished in: Games Econ. Behav. (2010)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- minimum cost flow
- np hard
- minimum spanning tree
- linear relaxation
- approximation algorithms
- minimum weight
- np complete
- minimum spanning trees
- undirected graph
- network simplex algorithm
- network flow
- minimum cost path
- capacity constraints
- similarity measure
- combinatorial optimization
- linear program
- bayesian networks