A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.
Sándor P. FeketeSamir KhullerMonika KlemmsteinBalaji RaghavachariNeal E. YoungPublished in: J. Algorithms (1997)
Keyphrases
- network flow
- spanning tree
- minimum cost
- edge disjoint
- np hard
- edge weights
- network flow problem
- min cost
- minimum spanning tree
- approximation algorithms
- minimum spanning trees
- linear programming
- total length
- integer programming
- data points
- optimization model
- graph theoretic
- genetic algorithm
- computational complexity
- undirected graph
- lower bound
- np complete
- graphical models