The Maximum Distance Problem and Minimum Spanning Trees
Given a compact E⊂R<sup>n</sup> and s>0, the maximum distance problem seeks a compact and connected subset of R<sup>n</sup> of smallest one dimensional Hausdorff measure whose s-neighborhood covers E. For E⊂R<sup>2</sup>, we prove that minimizing over minim...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Etamaths Publishing
2021-08-01
|
| Series: | International Journal of Analysis and Applications |
| Online Access: | http://etamaths.com/index.php/ijaa/article/view/2360 |