Sublinear Algorithms for (1.5+𝜖)-Approximate Matching-Reference-Cited by-同舟云学术

Sublinear Algorithms for (1.5+𝜖)-Approximate Matching

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bhattacharya Sayan¹,Kiss Peter²,Saranurak Thatchaphol³

Affiliation:

1. University of Warwick, UK

2. University of Warwick, UK / MPI-INF, Germany

3. University of Michigan, USA

Funder

Engineering and Physical Sciences Research Council

Publisher

ACM

Link

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

Reference25 articles.

1. Anna Adamaszek , Matthias Mnich , and Katarzyna Paluch . 2018 . New Approximation Algorithms for (1, 2)-TSP. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 , July 9-13, 2018, Prague, Czech Republic. Anna Adamaszek, Matthias Mnich, and Katarzyna Paluch. 2018. New Approximation Algorithms for (1, 2)-TSP. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic.

2. Sepehr Assadi , MohammadHossein Bateni , Aaron Bernstein , Vahab S. Mirrokni , and Clif Stein . 2019 . Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. In SODA. Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, and Clif Stein. 2019. Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. In SODA.

3. Sepehr Assadi and Soheil Behnezhad. 2021. Beating Two-Thirds For RandomOrder Streaming Matching. In ICALP. Sepehr Assadi and Soheil Behnezhad. 2021. Beating Two-Thirds For RandomOrder Streaming Matching. In ICALP.

4. Sepehr Assadi and Aaron Bernstein. 2019. Towards a Unified Theory of Sparsification for Matching Problems. In SOSA. Sepehr Assadi and Aaron Bernstein. 2019. Towards a Unified Theory of Sparsification for Matching Problems. In SOSA.

5. Soheil Behnezhad. 2021. Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. In FOCS. Soheil Behnezhad. 2021. Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. In FOCS.

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

1. Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time;Journal of the ACM;2024-07-23

2. Approximating Maximum Matching Requires Almost Quadratic Time;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. Local Computation Algorithms for Maximum Matching: New Lower Bounds;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

5. Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06