The Power of Greedy for Online Minimum Cost Matching on the Line-Reference-Cited by-同舟云学术

The Power of Greedy for Online Minimum Cost Matching on the Line

Published:2023-07-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 24th ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Balkanski Eric¹^ORCID,Faenza Yuri²^ORCID,Périvier Noémie²^ORCID

Affiliation:

1. Columbia University, New York, United States of America

2. Columbia University, New York, USA

Funder

NSF (National Science Foundation)

Publisher

ACM

Link

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

Reference48 articles.

1. The Value of Excess Supply in Spatial Matching Markets

2. Antonios Foivos Antoniadis , Neal Barcelo , Michael Nugent , Kirk Pruhs , and Michele Scquizzato . 2014 . A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line . In Workshop on Approximation and Online Algorithms. Antonios Foivos Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, and Michele Scquizzato. 2014. A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line. In Workshop on Approximation and Online Algorithms.

3. Greedy Matching in Bipartite Random Graphs

4. David Arthur , Bodo Manthey , and Heiko Röglin . 2009 . K-means has polynomial smoothed complexity . In 2009 50th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 405--414 . David Arthur, Bodo Manthey, and Heiko Röglin. 2009. K-means has polynomial smoothed complexity. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 405--414.

5. Eric Balkanski , Yuri Faenza , and Mathieu Kubik . 2022 . The Simultaneous Semi-random Model for TSP. In International Conference on Integer Programming and Combinatorial Optimization. Springer, 43--56 . Eric Balkanski, Yuri Faenza, and Mathieu Kubik. 2022. The Simultaneous Semi-random Model for TSP. In International Conference on Integer Programming and Combinatorial Optimization. Springer, 43--56.