Merge-proofness in minimum cost spanning tree problems.
María Gómez-RúaJuan J. Vidal-PugaPublished in: Int. J. Game Theory (2011)
Keyphrases
- minimum cost
- spanning tree
- minimum cost flow
- network flow problem
- np hard
- linear relaxation
- approximation algorithms
- network flow
- minimum spanning tree
- minimum spanning trees
- capacity constraints
- special case
- optimization problems
- minimum cost path
- np complete
- network simplex algorithm
- minimum weight
- computational complexity