An axiomatic approach in minimum cost spanning tree problems with groups.
Gustavo BergantiñosMaría Gómez-RúaPublished in: Ann. Oper. Res. (2015)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- np hard
- minimum cost flow
- approximation algorithms
- linear relaxation
- minimum spanning tree
- network flow
- minimum spanning trees
- np complete
- capacity constraints
- minimum weight
- network simplex algorithm
- similarity measure
- undirected graph
- worst case
- lower bound
- computational complexity