The Euclidean Distortion of Complete Binary Trees
暂无分享,去创建一个
Abstract. Bourgain [1] showed that every embedding of the complete binary tree of depth n into l2 has metric distortion ≥ $\Omega(\sqrt{\log n})$ . An alternative proof was later given by Matousek [3]. This note contains a short proof for this fact.