Paper detail

Fermat-Steiner Problem in the Metric Space of Compact Sets endowed with Hausdorff Distance

The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric space $Y=H(X)$ of compact subsets of a metric space $X$, endowed with the Hausdorff distance. For the case of a proper metric space $X$ a description of all compacts $K\in H(X)$ which the minimum is attained at is obtained. In particular, the Steiner minimal trees for three-element boundaries are described. We also construct an example of a regular triangle in $H(R^2)$, such that all its shortest trees have no "natural" symmetry.

preprint2016arXivOpen access

Signal facts

What is known right now

Open access3 authors1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.