1. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: FOCS 1996, pp. 184–193 (1996)
2. Bartal, Y., Blum, A., Burch, C., Tomkins, A.: A polylog-competitive algorithm for metrical task systems. In: STOC 1997, pp. 711–719 (1997)
3. Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Disc. Math. 8, 359–387 (1995)
4. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.A.: Approximating a finite metric by a small number of tree metrics. In: FOCS 1998, pp. 379–388 (1998)
5. Chew, L.P.: There are planar graphs almost as good as the complete graph. J. of Comp. and Sys. Sci. 39, 205–219 (1989)