A quadratic distance bound on sliding between crossing-free spanning trees.
Oswin AichholzerKlaus ReinhardtPublished in: Comput. Geom. (2007)
Keyphrases
- spanning tree
- edge disjoint
- minimum cost
- minimum spanning tree
- minimum spanning trees
- worst case
- lower bound
- upper bound
- distance function
- undirected graph
- pairwise
- distance measure
- depth first search
- computational complexity
- edge weights
- total length
- distance matrix
- objective function
- sliding window
- np hard
- euclidean distance
- root node
- special case
- minimum total cost
- multimedia