Sublinear Time Algorithms and Complexity of Approximate Maximum Matching-Reference-Cited by-同舟云学术

Sublinear Time Algorithms and Complexity of Approximate Maximum 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:

Behnezhad Soheil¹,Roghani Mohammad²,Rubinstein Aviad²

Affiliation:

1. Northeastern University, USA

2. Stanford University, USA

Funder

David and Lucile Packard Fellowship

NSF

Publisher

ACM

Link

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

Reference24 articles.

2. Sepehr Assadi and Soheil Behnezhad . 2021. Beating Two-Thirds For Random-Order Streaming Matching . In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 , July 12-16, 2021, Glasgow, Scotland (Virtual Conference), Nikhil Bansal, Emanuela Merelli, and James Worrell (Eds.) (LIPIcs , Vol. 198). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 19:1–19: 13 . Sepehr Assadi and Soheil Behnezhad. 2021. Beating Two-Thirds For Random-Order Streaming Matching. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), Nikhil Bansal, Emanuela Merelli, and James Worrell (Eds.) (LIPIcs, Vol. 198). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 19:1–19:13.

3. Sepehr Assadi and Aaron Bernstein . 2019 . Towards a Unified Theory of Sparsification for Matching Problems . In 2nd Symposium on Simplicity in Algorithms, SOSA 2019 , January 8-9, 2019, San Diego, CA, USA, Jeremy T. Fineman and Michael Mitzenmacher (Eds.) (OASIcs , Vol. 69). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 11:1–11: 20 . Sepehr Assadi and Aaron Bernstein. 2019. Towards a Unified Theory of Sparsification for Matching Problems. In 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, Jeremy T. Fineman and Michael Mitzenmacher (Eds.) (OASIcs, Vol. 69). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 11:1–11:20.

4. Soheil Behnezhad . 2021. Improved Analysis of EDCS via Gallai-Edmonds Decomposition. CoRR, abs/2110.05746 ( 2021 ), arXiv:2110.05746. Soheil Behnezhad. 2021. Improved Analysis of EDCS via Gallai-Edmonds Decomposition. CoRR, abs/2110.05746 (2021), arXiv:2110.05746.

5. Soheil Behnezhad . 2021 . Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 , Denver, CO, USA , February 7-10, 2022. IEEE, 873–884. Soheil Behnezhad. 2021. Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. IEEE, 873–884.

Cited by 7 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. Parallel Maximum Cardinality Matching for General Graphs on GPUs;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27

5. Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27