Rate of convergence for the Euclidean minimum spanning tree limit law

DOI10.1016/0167-6377(93)90098-2zbMath0793.90059OpenAlexW2108203909MaRDI QIDQ1317005

Patrick Jaillet

Publication date: 24 March 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90098-2

zbMATH Keywords

asymptotic analysisEuclidean minimum spanning treeexact rate of convergenceoptimal spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27)

Related Items

Boundary effects in the traveling salesperson problem ⋮ On properties of geometric random problems in the plane ⋮ Asymptotics for Euclidean functionals with power-weighted edges ⋮ Rate of convergence of power-weighted Euclidean minimal spanning trees ⋮ Rates of convergence of means of Euclidean functionals

Cites Work

• Unnamed Item
• Growth rates of Euclidean minimal spanning trees with power weighted edges
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• A sharp deviation inequality for the stochastic traveling salesman problem
• Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Random Minimal Trees