Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference18 articles.
1. Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. J. Am. Math. Soc. 21(1), 1–21 (2008)
2. Bartal, Y.: Probabilistic approximations of metric space and its algorithmic application. In: 37th Annual Symposium on Foundations of Computer Science, pp. 183–193, October 1996
3. Bourgain, J.: On Lipschitz embedding of finite metric spaces in Hilbert space. Isr. J. Math. 52(1–2), 46–52 (1985)
4. Calinescu, G., Karloff, H., Rabani, Y.: Approximation algorithms for the 0-extension problem. In: Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 8–16, Philadelphia, PA (2001)
5. Dunagan, J., Vempala, S.: On Euclidean embeddings and bandwidth minimization. In: Randomization, Approximation, and Combinatorial Optimization, pp. 229–240. Springer, Berlin (2001)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献