Spanning tree with lower bound on the degrees.
Zoltán KirályPublished in: Discret. Appl. Math. (2018)
Keyphrases
- spanning tree
- lower bound
- upper bound
- minimum cost
- np hard
- branch and bound algorithm
- minimum spanning tree
- edge disjoint
- minimum spanning trees
- branch and bound
- minimum weight
- objective function
- undirected graph
- worst case
- lower and upper bounds
- optimal solution
- social networks
- approximation algorithms
- graphical models
- search algorithm
- root node
- sufficiently accurate
- minimum total cost