On obligation rules for minimum cost spanning tree problems.
Gustavo BergantiñosAnirban KarPublished in: BQGT (2010)
Keyphrases
- minimum cost
- spanning tree
- np hard
- minimum cost flow
- network flow problem
- linear relaxation
- network flow
- approximation algorithms
- minimum weight
- minimum spanning tree
- capacity constraints
- network simplex algorithm
- np complete
- optimization problems
- minimum spanning trees
- weighted graph
- undirected graph
- objective function
- mobile robot
- minimum total cost
- minimum cost path