Transforming spanning trees: A lower bound.
Kevin BuchinAndreas RazenTakeaki UnoUli WagnerPublished in: Comput. Geom. (2009)
Keyphrases
- spanning tree
- lower bound
- upper bound
- edge disjoint
- minimum cost
- np hard
- minimum spanning tree
- branch and bound
- objective function
- branch and bound algorithm
- lower and upper bounds
- minimum spanning trees
- lower bounding
- running times
- undirected graph
- worst case
- sample complexity
- approximation algorithms
- depth first search
- data structure
- edge weights
- root node
- polynomial approximation
- sufficiently accurate