Random Minimal Trees

DOI10.1137/0113021MaRDI QIDQ5536040zbMATH OpenOpenAlexFDO

Authors E. N. Gilbert

Publication date 1965

Published in Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0113021

zbMATH Keywords

operations research

Cited in

(7)

• Fast heuristic algorithms for rectilinear Steiner trees
• The relative neighbourhood graph of a finite planar set
• Rate of convergence for the Euclidean minimum spanning tree limit law
• On properties of geometric random problems in the plane
• scientific article; zbMATH DE number 3283155 (Why is no real title available?)
• Quantitative CLTs on the Poisson space via Skorohod estimates and p-Poincaré inequalities
• An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability

This page was built for publication: Random Minimal Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536040)