9. Online Embeddings
-
Problem 9.1.
[Yuri Rabinovich] Find a nontrivial lower bound (better than $\log n$) for online embedding an $n$-point metric space into $\ell_1$.
Cite this as: AimPL: Metric embeddings, available at http://aimpl.org/metricembeddings.