New streaming algorithms for high dimensional EMD and MST-Reference-Cited by-同舟云学术

New streaming algorithms for high dimensional EMD and MST

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Chen Xi¹,Jayaram Rajesh²,Levi Amit³,Waingarten Erik⁴

Affiliation:

1. Columbia University, USA

2. Google Research, USA

3. University of Waterloo, Canada

4. Stanford University, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3519979

Reference43 articles.

1. Pankaj K. Agarwal and R. Sharathkumar . 2014. Approximation algorithms for bipartite matching with metric and geometric costs . In Proceedings of the 46th ACM Symposium on the Theory of Computing (STOC ’2014) . 555–564. Pankaj K. Agarwal and R. Sharathkumar. 2014. Approximation algorithms for bipartite matching with metric and geometric costs. In Proceedings of the 46th ACM Symposium on the Theory of Computing (STOC ’2014). 555–564.

2. Alexandr Andoni , Piotr Indyk , and Robert Krauthgamer . 2008 . Earth mover distance over high-dimensional spaces . In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA ’2008) . 343–352. Alexandr Andoni, Piotr Indyk, and Robert Krauthgamer. 2008. Earth mover distance over high-dimensional spaces. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA ’2008). 343–352.

3. Alexandr Andoni Robert Krauthgamer and Krzysztof Onak. 2010. Streaming algorithms from precision sampling. arXiv preprint arXiv:1011.1263. Alexandr Andoni Robert Krauthgamer and Krzysztof Onak. 2010. Streaming algorithms from precision sampling. arXiv preprint arXiv:1011.1263.

4. Sketching and Embedding are Equivalent for Norms

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Streaming Algorithms for Geometric Steiner Forest;ACM Transactions on Algorithms;2024-08-05

2. Data-Dependent LSH for the Earth Mover’s Distance;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Approximate Earth Mover’s Distance in Truly-Subquadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment;ACM Journal of Experimental Algorithmics;2023-08-11

5. Streaming Euclidean Max-Cut: Dimension vs Data Reduction;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02