9,380 research outputs found
Recommended from our members
Fully dynamic maintenance of euclidean minimum spanning trees
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in time O(n^5/6 log1^2/2 n) per update operation. No nontrivial dynamic geometric minimum spanning tree algorithm was previously known. We reduce the problem to maintaining bichromatic closest pairs, which we also solve in the same time bounds. Our algorithm uses a novel construction, the ordered nearest neighbors of a sequence of points. Any point set or bichromatic point set can be ordered so that this graph is a simple path
Incremental Network Design with Minimum Spanning Trees
Given an edge-weighted graph and a set , the
incremental network design problem with minimum spanning trees asks for a
sequence of edges minimizing
where is the weight of a minimum spanning tree
for the subgraph and . We prove that this problem can be solved by a greedy
algorithm.Comment: 9 pages, minor revision based on reviewer comment
Recommended from our members
Fully dynamic maintenance of Euclidean minimum spanning trees and maxima of decomposable functions
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in time O(n^1/2 log^2 n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n^E) per update. Our algorithm uses a novel construction, the ordered nearest neighbors of a sequence of points. Any point set or bichromatic point set can be ordered so that this graph is a simple path. Our results generalize to higher dimensions, and to fully dynamic algorithms for maintaining maxima of decomposable functions, including the diameter of a point set and the bichromatic farthest pair
- β¦