n-Ellipses and the Minimum Distance Sum Problem
From MaRDI portal
Publication:2757353
DOI10.2307/2589675zbMath0986.51040OpenAlexW4244478223MaRDI QIDQ2757353
Publication date: 26 November 2001
Full work available at URL: https://doi.org/10.2307/2589675
Related Items (8)
Classical curve theory in normed planes ⋮ MinMax-Distance Gathering on Given Meeting Points ⋮ Minimizing inside a triangle with GeoGebra ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ New fixed figure results with the notion of k-ellipse ⋮ Steiner reducing sets of minimum weight triangulations: Structure and topology ⋮ On the location of the minimum point in the Euclidean distance sum problem ⋮ On minimum- and maximum-weight minimum spanning trees with neighborhoods
This page was built for publication: n-Ellipses and the Minimum Distance Sum Problem
