The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach

From MaRDI portal
Publication:1186299

DOI10.1214/aoap/1177005773zbMath0755.60011OpenAlexW1996075091MaRDI QIDQ1186299

Florin Avram, Dimitris J. Bertsimas

Publication date: 28 June 1992

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1177005773




Related Items (20)

Principal curves of oriented points: theoretical and computational improvementsEuclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning CaterpillarsOn properties of geometric random problems in the planeLimit behaviors of random connected graphs driven by a Poisson processMultivariate tests of uniformityContinuous approximation formulas for location problemsGeometry of the minimal spanning tree in the heavy-tailed regime: new universality classesConnected spatial networks over random points and a route-length statisticA sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networksEstimating the asymptotic constant of the total length of Euclidean minimal spanning trees with power-weighted edges.On the Difference of Expected Lengths of Minimum Spanning TreesThe random minimal spanning tree in high dimensionsOn Edge-Disjoint Spanning Trees in a Randomly Weighted Complete GraphAsymptotics for Euclidean minimal spanning trees on random pointsOn finding a minimum spanning tree in a network with random weightsGeometry of the minimal spanning tree of a random 3-regular graphAn empirical study of tests for uniformity in multidimensional dataContinuum percolation and Euclidean minimal spanning trees in high dimensionsErgodic theorems for some classical problems in combinatorial optimizationNew Bounds for the Traveling Salesman Constant




This page was built for publication: The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach