Transitions in geometric minimum spanning trees
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Algorithms for finding low degree structures
Approximation algorithms for NP-hard problems
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Euclidean bounded-degree spanning tree ratios
Proceedings of the nineteenth annual symposium on Computational geometry
Statistical methods in algorithm design and analysis.
Statistical methods in algorithm design and analysis.
Probabilistic analysis for a multiple depot vehicle routing problem
Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
Light orthogonal networks with constant geometric dilation
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Smoothed analysis of partitioning algorithms for Euclidean functionals
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
| Hi-index | 0.00 |
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0, 1]d and a degree constraint b ≥ 2. The aim is to find a minimum weight spanning tree in which each vertex has degree at most b. In this paper we analyze the probabilistic version of the problem and prove in affirmative the conjecture of Yukich stated in 1998 on the asymptotics of the problem for uniformly (and also some non-uniformly) distributed points in [0, 1]d: the optimal length LbMST (X1, . . ., Xn) of a b-degree constrained minimal spanning tree on X1, . . ., Xn given by iid random variables with values in [0, 1]d satisfies lim/n→∞ LbMST (X1, . . ., Xn)/n(d-1)/d = α(LbMST, d)∫[0,1]d f(x)(d-1)/ddx c.c., where α(LbMST, d) is a positive constant, f is the density of the absolutely continuous part of the law of X1 and c.c. stands for complete convergence. In the case b = 2, the b-degree constrained MST has the same asymptotic behavior as the TSP, and we have α(LbMST, d) = α(LTSP, d). We also show concentration of LbMST around its mean and around α(LbMST, d)n(d-1)/d. The result of this paper may spur further investigation of probabilistic spanning tree problems with degree constraints.