Abstract

The size sz(T) of an l1-graph T = (V, E) is the minimum of nf/tf over all the possible l1-embeddings f into nf-dimensional hypercube with scale tf. The sum of distances between all the pairs of vertices of F is at most sz(T)[v/2][v/2] (v = \V\). The latter is an
... read more