Minimum cost spanning tree games and population monotonic allocation schemes.
Henk NordeStefano MorettiStef TijsPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- minimum cost
- spanning tree
- np hard
- approximation algorithms
- minimum spanning tree
- allocation scheme
- minimum weight
- capacity constraints
- network flow
- network flow problem
- minimum spanning trees
- network simplex algorithm
- undirected graph
- minimum cost flow
- combinatorial auctions
- resource allocation
- edit operations
- shortest path
- special case
- minimum total cost
- evolutionary algorithm