Author of the publication

Deterministic, near-linear ε-approximation algorithm for geometric bipartite matching.

, , , and . STOC, page 1052-1065. ACM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Two Algorithmic Schemes for Geometric Bipartite Matching and Transportation.. Duke University, Durham, NC, USA, (2020)base-search.net (ftdukeunivdsp:oai:localhost:10161/21520).Dynamic Geometric Set Cover and Hitting Set., , , , and . ACM Trans. Algorithms, 18 (4): 40:1-40:37 (2022)Approximate Minimum-Weight Matching with Outliers Under Translation., , , , , , and . ISAAC, volume 123 of LIPIcs, page 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Faster Algorithms for the Geometric Transportation Problem., , , , and . CoRR, (2019)Efficient Algorithms for Geometric Partial Matching., , and . SoCG, volume 129 of LIPIcs, page 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Dynamic Geometric Set Cover and Hitting Set., , , , and . SoCG, volume 164 of LIPIcs, page 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Deterministic, near-linear ε-approximation algorithm for geometric bipartite matching., , , and . STOC, page 1052-1065. ACM, (2022)