A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
Sándor P. FeketeSamir KhullerMonika KlemmsteinBalaji RaghavachariNeal E. YoungPublished in: CoRR (2002)
Keyphrases
- network flow
- spanning tree
- minimum cost
- edge disjoint
- np hard
- edge weights
- minimum spanning tree
- network flow problem
- approximation algorithms
- bounded degree
- integer programming
- min cost
- minimum spanning trees
- linear programming
- undirected graph
- optimization model
- graph theoretic
- upper bound
- total length
- information extraction
- search space