| Register
\(\newcommand{\Cat}{{\rm Cat}} \) \(\newcommand{\A}{\mathcal A} \) \(\newcommand{\freestar}{ \framebox[7pt]{$\star$} }\)

14. Partial Embeddings into Trees

    1. Problem 14.1.

      [Kristin Sheridan] Given an input metric space $M$ and distortion $c<\infty$, can we efficiently approximate the maximal number $m$ such that there exists a subset of $M$ of cardinality $m$ that embeds into trees with distortion at most $c$?

          Cite this as: AimPL: Metric embeddings, available at http://aimpl.org/metricembeddings.