Approximation algorithms for bipartite matching with metric and geometric costs-Reference-Cited by-同舟云学术

Approximation algorithms for bipartite matching with metric and geometric costs

Published:2014-05-31 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-sixth annual ACM symposium on Theory of computing
language:
Short-container-title:

Author:

Agarwal Pankaj K.¹,Sharathkumar R.²

Affiliation:

1. Duke University

2. Stanford University

Funder

Engineer Research and Development Center

National Science Foundation

Division of Computing and Communication Foundations

Defense Advanced Research Projects Agency

United States-Israel Binational Science Foundation

Air Force Office of Scientific Research

Army Research Office

Publisher

ACM

Link

Reference34 articles.

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

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

2. 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 deterministic near-linear time approximation scheme for geometric transportation;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

5. Koios: Top-k Semantic Overlap Set Search;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04