1. Yonatan Aumann and Yuval Rabani: An O(logk) approximate min-cut max-flow theorem and approximation algorithm, SIAM J. Comput. 27(1) (1998), 291–301 (electronic).
2. Yair Bartal: Probabilistic approximations of metric space and its algorithmic application, in: 37th Annual Symposium on Foundations of Computer Science, 183–193, October 1996.
3. Yair Bartal: On approximating arbitrary metrics by tree metrics, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 183–193, 1998.
4. D. Carroll and A. Goel: Lower bounds for embedding into distributions over excluded minor graph families, in: Proceedings of the 12th European Symposium on Algorithms, 2004.
5. Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich and Alistair Sinclair: Embedding k-outerplanar graphs into l 1, SIAM J. Discrete Math. 20(1) (2006), 119–136 (electronic).