Approximating minimum-cost graph problems with spanning tree edges.
Michel X. GoemansDavid P. WilliamsonPublished in: Oper. Res. Lett. (1994)
Keyphrases
- spanning tree
- minimum cost
- minimum spanning tree
- network flow problem
- edge disjoint
- undirected graph
- minimum cost flow
- minimum weight
- np hard
- minimum spanning trees
- network flow
- edge weights
- approximation algorithms
- capacity constraints
- weighted graph
- network simplex algorithm
- minimum total cost
- optimization problems
- computational complexity
- combinatorial optimization
- minimum cost path
- simulated annealing