1. Abraham, I., Bartal, Y., Neiman, O.: Embedding metric spaces in their intrinsic dimension. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’08, pp. 363–372. Society for Industrial and Applied Mathematics, Philadelphia (2008)
2. Assouad, P.: Plongements lipschitziens dans ℝ n . Bull. Soc. Math. France 111(4), 429–448 (1983)
3. Bo, B., Charikar, M.: On the impossibility of dimension reduction in l1. J. ACM 52(5), 766–788 (2005)
4. Bartal, Y., Gottlieb, L.-A., Krauthgamer, R.: The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. In: Proceedings of the 44th symposium on Theory of Computing, STOC ’12, pp 663–672. ACM, New York (2012)
5. Bollobás, B.: Extremal graph theory. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London (1978)