\def\cprime{$'$}
\begin{thebibliography}{10}

\bibitem{ARV04}
S.~Arora, S.~Rao, and U.~Vazirani.
\newblock Expander flows, geometric embeddings, and graph partitionings.
\newblock In {\em 36th Annual Symposium on the Theory of Computing}, pages
  222--231, 2004.
\newblock To appear.

\bibitem{Ass83}
P.~Assouad.
\newblock Plongements lipschitziens dans {${\bf R}\sp{n}$}.
\newblock {\em Bull. Soc. Math. France}, 111(4):429--448, 1983.

\bibitem{AR98}
Y.~Aumann and Y.~Rabani.
\newblock An {$O(\log k)$} approximate min-cut max-flow theorem and
  approximation algorithm.
\newblock {\em SIAM J. Comput.}, 27(1):291--301 (electronic), 1998.

\bibitem{Bartal96}
Y.~Bartal.
\newblock Probabilistic approximations of metric space and its algorithmic
  application.
\newblock In {\em 37th Annual Symposium on Foundations of Computer Science},
  pages 183--193, October 1996.

\bibitem{Bourgain85}
J.~Bourgain.
\newblock On {L}ipschitz embedding of finite metric spaces in {H}ilbert space.
\newblock {\em Israel J. Math.}, 52(1-2):46--52, 1985.

\bibitem{CKR01}
G.~Calinescu, H.~Karloff, and Y.~Rabani.
\newblock Approximation algorithms for the 0-extension problem.
\newblock In {\em Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete
  Algorithms}, pages 8--16, Philadelphia, PA, 2001. SIAM.

\bibitem{CCGGP}
M.~Charikar, C.~Chekuri, A.~Goel, S.~Guha, and S.~Plotkin.
\newblock Approximating a finite metric by a small number of tree metrics.
\newblock In {\em Proceedings of the 39th Annual {IEEE} Symposium on
  Foundations of Computer Science}, 1998.

\bibitem{DV01}
J.~Dunagan and S.~Vempala.
\newblock On {E}uclidean embeddings and bandwidth minimization.
\newblock In {\em Randomization, approximation, and combinatorial
  optimization}, pages 229--240. Springer, 2001.

\bibitem{FHRT03}
J.~Fakcharoenphol, C.~Harrelson, S.~Rao, and K.~Talwar.
\newblock An improved approximation algorithm for the 0-extension problem.
\newblock In {\em Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete
  Algorithms}, pages 257--265, New York, 2003. ACM.

\bibitem{FRT03}
J.~Fakcharoenphol, S.~Rao, and K.~Talwar.
\newblock A tight bound on approximating arbitrary metrics by tree metrics.
\newblock In {\em Proceedings of the 35th Annual ACM Symposium on Theory of
  Computing}, pages 448--455, 2003.

\bibitem{FT03}
J.~Fakcharoenphol and K.~Talwar.
\newblock An improved decomposition theorem for graphs excluding a fixed minor.
\newblock In {\em Proceedings of 6th Workshop on Approximation, Randomization,
  and Combinatorial Optimization}, volume 2764 of {\em Lecture Notes in
  Computer Science}, pages 36--46. Springer, 2003.

\bibitem{Feige00}
U.~Feige.
\newblock Approximating the bandwidth via volume respecting embeddings.
\newblock {\em J. Comput. System Sci.}, 60(3):510--539, 2000.

\bibitem{Gupta-thesis}
A.~Gupta.
\newblock Embeddings of finite metrics.
\newblock Ph.D. thesis, University of California, Berkeley, 2000.

\bibitem{GKL03}
A.~Gupta, R.~Krauthgamer, and J.~R. Lee.
\newblock Bounded geometries, fractals, and low-distortion embeddings.
\newblock In {\em 44th Symposium on Foundations of Computer Science}, pages
  534--543, 2003.

\bibitem{Heinonen01}
J.~Heinonen.
\newblock {\em Lectures on analysis on metric spaces}.
\newblock Universitext. Springer-Verlag, New York, 2001.

\bibitem{Ind01}
P.~Indyk.
\newblock Algorithmic applications of low-distortion geometric embeddings.
\newblock In {\em 42nd Annual Symposium on Foundations of Computer Science},
  pages 10--33. IEEE Computer Society, 2001.

\bibitem{john}
F.~John.
\newblock Extremum problems with inequalities as subsidiary conditions.
\newblock In {\em Studies and Essays Presented to R. Courant on his 60th
  Birthday, January 8, 1948}, pages 187--204. Interscience Publishers, Inc.,
  New York, N. Y., 1948.

\bibitem{jl}
W.~B. Johnson and J.~Lindenstrauss.
\newblock Extensions of {L}ipschitz mappings into a {H}ilbert space.
\newblock In {\em Conference in modern analysis and probability (New Haven,
  Conn., 1982)}, pages 189--206. Amer. Math. Soc., Providence, RI, 1984.

\bibitem{KPR93}
P.~N. Klein, S.~A. Plotkin, and S.~Rao.
\newblock Excluded minors, network decomposition, and multicommodity flow.
\newblock In {\em Proceedings of the 25th Annual ACM Symposium on Theory of
  Computing}, pages 682--690, 1993.

\bibitem{KLM}
R.~Krauthgamer, N.~Linial, and A.~Magen.
\newblock Metric embeddings--beyond one-dimensional distortion.
\newblock {\em Discrete Comput. Geom.}, 31(3):339--356, 2004.

\bibitem{Laakso}
T.~J. Laakso.
\newblock Plane with {$A\sb \infty$}-weighted metric not bi-{L}ipschitz
  embeddable to {${\Bbb R}\sp N$}.
\newblock {\em Bull. London Math. Soc.}, 34(6):667--676, 2002.

\bibitem{Lang}
U.~Lang and C.~Plaut.
\newblock Bilipschitz embeddings of metric spaces into space forms.
\newblock {\em Geom. Dedicata}, 87(1-3):285--307, 2001.

\bibitem{Lar67}
D.~G. Larman.
\newblock A new theory of dimension.
\newblock {\em Proc. London Math. Soc.}, 17:178--192, 1967.

\bibitem{LMN04}
J.~R. Lee, M.~Mendel, and A.~Naor.
\newblock Metric structures in {$L_1$}: Dimension, snowflakes, and average
  distortion.
\newblock {\em European J. Combin.}
\newblock To appear.

\bibitem{LN03-unified}
J.~R. Lee and A.~Naor.
\newblock Extending {L}ipschitz functions via random metric partitions.
\newblock {\em Invent. Math.}
\newblock To appear.

\bibitem{cluster}
J.~R. Lee and A.~Naor.
\newblock Random metric decomposition: Basic theory.
\newblock {\em Preprint}, 2004.

\bibitem{LLR95}
N.~Linial, E.~London, and Y.~Rabinovich.
\newblock The geometry of graphs and some of its algorithmic applications.
\newblock {\em Combinatorica}, 15(2):215--245, 1995.

\bibitem{LinialSaks}
N.~Linial and M.~Saks.
\newblock Low diameter graph decompositions.
\newblock {\em Combinatorica}, 13(4):441--454, 1993.

\bibitem{Luukk98}
J.~Luukkainen.
\newblock Assouad dimension: antifractal metrization, porous sets, and
  homogeneous measures.
\newblock {\em J. Korean Math. Soc.}, 35(1):23--76, 1998.

\bibitem{Magen02}
A.~Magen.
\newblock Dimensionality reductions that preserve volumes and distance to
  affine spaces, and their algorithmic applications.
\newblock In {\em Randomization, approximation, and combinatorial optimization
  (RANDOM)}, Cambdrige, MA, 2002. Springer-Verlag.

\bibitem{Mat01}
J.~Matou{\v{s}}ek.
\newblock {\em Lectures on discrete geometry}, volume 212 of {\em Graduate
  Texts in Mathematics}.
\newblock Springer-Verlag, New York, 2002.

\bibitem{jiriproblems}
J.~Matou{\v{s}}ek.
\newblock Open problems on embeddings of finite metric spaces.
\newblock {\em Available at http://kam.mff.cuni.cz/$\sim$matousek/haifaop.ps},
  2002.

\bibitem{Rao99}
S.~Rao.
\newblock Small distortion and volume preserving embeddings for planar and
  {E}uclidean metrics.
\newblock In {\em Proceedings of the 15th Annual Symposium on Computational
  Geometry}, pages 300--306, New York, 1999. ACM.

\bibitem{volberg}
A.~L. Vol{\cprime}berg and S.~V. Konyagin.
\newblock On measures with the doubling condition.
\newblock {\em Izv. Akad. Nauk SSSR Ser. Mat.}, 51(3):666--675, 1987.

\end{thebibliography}