The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study

DOI10.1017/S0305004115000250zbMath1371.60085arXiv1404.2653OpenAlexW2962785303MaRDI QIDQ5360331

Tamar Lando, David J. Aldous

Publication date: 28 September 2017

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.2653

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Deterministic network models in operations research (90B10) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items

Connected spatial networks over random points and a route-length statistic ⋮ Route lengths in invariant spatial tree networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards tight bounds on theta-graphs: more is not always better
• Connected spatial networks over random points and a route-length statistic
• On Steiner trees for bounded point sets
• Classes of graphs which approximate the complete Euclidean graph
• Probability theory of classical Euclidean optimization problems
• Average stretch factor: how low does it go?
• On the homogeneous planar Poisson point process
• Scale-invariant random spatial networks
• On the Spanning Ratio of Theta-Graphs
• Geometric Spanner Networks
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• On the Average Number of Edges in Theta Graphs
• Short-length routes in low-cost networks via Poisson line patterns