Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms.
Gustavo BergantiñosJuan J. Vidal-PugaPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- minimum cost
- spanning tree
- minimum cost flow
- cooperative
- network flow problem
- np hard
- approximation algorithms
- linear relaxation
- minimum spanning tree
- network flow
- minimum spanning trees
- undirected graph
- network simplex algorithm
- np complete
- capacity constraints
- minimum weight
- mobile robot
- high dimensional
- search algorithm