The minimal spanning tree and the upper box dimension

DOI10.1090/S0002-9939-05-08061-5zbMath1083.68137arXivmath/0311481MaRDI QIDQ3372096

Gideon Stupp, Zvi Lotker, Gady Kozma

Publication date: 17 February 2006

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

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

Mathematics Subject Classification ID

Trees (05C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

A Fractal Dimension for Measures via Persistent Homology ⋮ On the connectivity threshold for general uniform metric spaces ⋮ Persistent homology and the upper box dimension ⋮ Remez-type inequality for discrete sets ⋮ Fractal dimension and the persistent homology of random geometric complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the length of optimal TSP circuits in sets of bounded diameter
• Worst case asymptotics for some classical optimization problems
• The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
• Worst case asymptotics of power-weighted Euclidean functionals
• The shortest path and the shortest road through n points
• Steiner Minimal Trees
• Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
• On the Shortest Path Through a Number of Points

This page was built for publication: The minimal spanning tree and the upper box dimension