game in minimum cost spanning tree problems.
Gustavo BergantiñosJuan J. Vidal-PugaPublished in: Int. J. Game Theory (2007)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- minimum cost flow
- np hard
- approximation algorithms
- linear relaxation
- network flow
- undirected graph
- minimum spanning tree
- minimum weight
- capacity constraints
- np complete
- minimum spanning trees
- network simplex algorithm
- lower bound
- minimum cost path
- combinatorial optimization
- complex networks
- linear programming