Minimum cost spanning tree problems with indifferent agents.
Christian TrudeauPublished in: Games Econ. Behav. (2014)
Keyphrases
- special case
- minimum cost
- spanning tree
- approximation algorithms
- np hard
- network flow problem
- np complete
- linear relaxation
- network flow
- minimum cost flow
- multi agent
- minimum spanning tree
- capacity constraints
- multi agent systems
- network simplex algorithm
- minimum cost path
- undirected graph
- minimum weight
- minimum spanning trees
- dynamic environments
- linear programming
- greedy heuristic
- weighted graph
- upper bound