Author:
Gupta Anupam,Talwar Kunal
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Assouad, P.: Plongements Lipschitziens dans R n . Bull. Soc. Math. France 111(4), 429–448 (1983)
2. Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: The 23rd International Conference on Machine Learning (ICML) (2006)
3. Călinescu, G., Karloff, H., Rabani, Y.: Approximation algorithms for the 0-extension problem. SIAM J. Comput. 34(2), 358–372 (2004/2005)
4. Chan, T.-H.H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 762–771 (2005)
5. Clarkson, K.L.: Nearest neighbor queries in metric spaces. Discrete Comput. Geom. 22(1), 63–93 (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bi-Lipschitz embeddings of quasiconformal trees;Proceedings of the American Mathematical Society;2023-02-02
2. Bi-Lipschitz geometry of quasiconformal trees;Illinois Journal of Mathematics;2022-06-01