TL;DR研究度量扭曲问题:有两个点集 V 和 C,它们在相同的度量空间中,我们的目标是选择 C 中一点,其到 V 点的总距离尽可能小。我们提出了使用排名作为输入的算法,并提供了它们的扭曲界限。
Abstract
We study the following metric distortion problem: there are two finite sets
of points, $V$ and $C$, that lie in the same metric space, and our goal is to
choose a point in $C$ whose total distance from the points in $V$ is as small
as possible. However, rather than having access to the