Rates of convergence of means for distance-minimizing subadditive Euclidean functionals

DOI10.1214/AOAP/1177004976zbMath0809.60016OpenAlexW2056750455MaRDI QIDQ1336595

Kenneth S. Alexander

Publication date: 26 March 1995

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

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

zbMATH Keywords

traveling salesman problemSteiner treeminimal spanning treesubadditive Euclidean functionalminimal matching

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27)

Related Items (9)

Asymptotics for weighted minimal spanning trees on random points ⋮ Boundary effects in the traveling salesperson problem ⋮ Asymptotics for transportation cost in high dimensions ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Rate of convergence of power-weighted Euclidean minimal spanning trees ⋮ Rates of convergence of means of Euclidean functionals ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees ⋮ The central limit theorem for weighted minimal spanning trees on random points

This page was built for publication: Rates of convergence of means for distance-minimizing subadditive Euclidean functionals