Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations.
Luis Eduardo Neves GouveiaPedro MouraPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- spanning tree
- root node
- undirected graph
- minimum total cost
- edge disjoint
- leaf nodes
- edge weights
- minimum cost
- minimum spanning tree
- lowest cost
- knapsack problem
- minimum spanning trees
- dynamic programming
- special case
- upper bound
- graph structure
- total cost
- multimedia
- np hard
- depth first search
- expected cost
- weighted graph
- query logs