SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding the shortest bottleneck edge in a parametric minimum spanning tree
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Decision-making based on approximate and smoothed Pareto curves
Theoretical Computer Science
Kinetic algorithms via self-adjusting computation
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A minimum spanning tree algorithm for efficient P2P video streaming system
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Maintaining approximate minimum steiner tree and k-center for mobile agents in a sensor network
INFOCOM'10 Proceedings of the 29th conference on Information communications
Minimum spanning tree on spatio-temporal networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
The weighted maximum-mean subtree and other bicriterion subtree problems
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Decision making based on approximate and smoothed pareto curves
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Kinetic euclidean minimum spanning tree in the plane
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Kinetic Euclidean minimum spanning tree in the plane
Journal of Discrete Algorithms
Kinetic pie delaunay graph and its applications
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Kinetic and stationary point-set embeddability for plane graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter $\lambda$ and wish to compute the sequence of minimum spanning trees generated as $\lambda$ varies. We also consider the kinetic minimum spanning tree problem, in which $\lambda$ represents time and the graph is subject in addition to changes such as edge insertions, deletions, and modifications of the weight functions as time progresses. We solve both problems in time $O(n^{2/3}\log^{4/3}n)$ per combinatorial change in the tree (or randomized $O(n^{2/3}\log n)$ per change). Our time bounds reduce to $O(n^{1/2}\log^{3/2} n)$ per change ($O(n^{1/2}\log n)$ randomized) for planar graphs or other minor-closed families of graphs, and $O(n^{1/4}\log^{3/2} n)$ per change ($O(n^{1/4}\log n)$ randomized) for planar graphs with weight changes but no insertions or deletions.