An egalitarian solution to minimum cost spanning tree problems.
Emre DoganIbrahim Baris EsmerokPublished in: Int. J. Game Theory (2024)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- linear relaxation
- minimum cost flow
- np hard
- approximation algorithms
- network flow
- capacity constraints
- undirected graph
- minimum spanning tree
- network simplex algorithm
- np complete
- optimization problems
- minimum cost path
- optimal solution
- graphical models
- integer programming
- minimum weight
- edit operations
- minimum spanning trees