Characterizations of the Kar and Folk solutions for Minimum Cost Spanning Tree Problems.
Christian TrudeauPublished in: IGTR (2013)
Keyphrases
- minimum cost
- spanning tree
- minimum cost flow
- network flow problem
- np hard
- linear relaxation
- approximation algorithms
- network flow
- minimum spanning tree
- network simplex algorithm
- minimum weight
- minimum cost path
- undirected graph
- minimum spanning trees
- optimal solution
- capacity constraints
- np complete
- upper bound
- special case
- graphical models
- high dimensional