Aug 10, 2011 · We show that every n-point tree metric admits a (1+eps)-embedding into a C(eps) log n-dimensional L_1 space, for every eps > 0, where C(eps) = O((1/eps)^

The papers in this volume were presented at the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, held January 17–19, 2012 in Kyoto, Japan.

Dimension reduction for finite trees in l1. In SODA, pages 43–50, 2012. [LN04]. James R. Lee and Assaf Naor. Embedding the diamond graph in Lp and dimension.

The present paper resolves this question, achieving the volume lower bound for all finite trees. Theorem 1.1. For every ε > 0 and n ∈ N, the following holds.

Dimension Reduction for Finite Trees in l(1). December 2013; Discrete & Computational Geometry 50(4). DOI:10.1007/s00454-013-9536-7.

It is shown that every n-point tree metric admits a (1+\varepsilon ) embedding into C(1+ε)-embedding into ℓ1C(ε)logn, which matches the natural volume lower ...

Oct 10, 2013 · 9. Lee, J.R., de Mesmay, A., Moharrami, M.: Dimension reduction for finite trees in \(l_{1}\). In: SODA, pp. 43–50 (2012). 10. Lee, J.R. ...

We show that every n-point tree metric admits a (1 + ε)-embedding into l1C(ε) log n, for every ε > 0, where C(ε) ≤ O ((1/ε)4 log 1/ε)).

Oct 10, 2013 · In fact, we show that this approach can handle arbitrary k-ary complete trees, with distortion 1 + ε. Unknown to us at the time of discovery, a ...

Missing: l1. | Show results with:l1.