Papers › The Maximum Distance Problem and Minimal Spanning Trees
The Maximum Distance Problem and Minimal Spanning Trees
Enrique G. Alvarado, Bala Krishnamoorthy, Kevin R. Vixie
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Given a compact E ⊂ℝⁿ and s > 0, the maximum distance problem seeks a compact and connected subset of ℝⁿ of smallest one dimensional Hausdorff measure whose s-neighborhood covers E. For E⊂ℝ², we prove that minimizing over minimum spanning trees that connect the centers of balls of radius s, which cover E, solves the maximum distance problem. The main difficulty in proving this result is overcome by the proof of Lemma 3.5, which states that one is able to cover the s-neighborhood of a Lipschitz curve Γ in ℝ² with a finite number of balls of radius s, and connect their centers with another Lipschitz curve Γ_∗, where ℋ¹(Γ_∗) is arbitrarily close to ℋ¹(Γ). We also present an open source package for computational exploration of the maximum distance problem using minimum spanning trees, available at https://github.com/mtdaydream/MDP_MST.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections