Faster Semi-streaming Matchings via Alternating Trees
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915252857208832 |
|---|---|
| author | Mitrović, Slobodan Mukherjee, Anish Sankowski, Piotr Sheu, Wen-Horng |
| author_facet | Mitrović, Slobodan Mukherjee, Anish Sankowski, Piotr Sheu, Wen-Horng |
| contents | We design a deterministic algorithm for the $(1+ε)$-approximate maximum matching problem. Our primary result demonstrates that this problem can be solved in $O(ε^{-6})$ semi-streaming passes, improving upon the $O(ε^{-19})$ pass-complexity algorithm by [Fischer, Mitrović, and Uitto, STOC'22]. This contributes substantially toward resolving Open question 2 from [Assadi, SOSA'24]. Leveraging the framework introduced in [FMU'22], our algorithm achieves an analogous round complexity speed-up for computing a $(1+ε)$-approximate maximum matching in both the Massively Parallel Computation (MPC) and CONGEST models.
The data structures maintained by our algorithm are formulated using blossom notation and represented through alternating trees. This approach enables a simplified correctness analysis by treating specific components as if operating on bipartite graphs, effectively circumventing certain technical intricacies present in prior work. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_19057 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Faster Semi-streaming Matchings via Alternating Trees Mitrović, Slobodan Mukherjee, Anish Sankowski, Piotr Sheu, Wen-Horng Data Structures and Algorithms We design a deterministic algorithm for the $(1+ε)$-approximate maximum matching problem. Our primary result demonstrates that this problem can be solved in $O(ε^{-6})$ semi-streaming passes, improving upon the $O(ε^{-19})$ pass-complexity algorithm by [Fischer, Mitrović, and Uitto, STOC'22]. This contributes substantially toward resolving Open question 2 from [Assadi, SOSA'24]. Leveraging the framework introduced in [FMU'22], our algorithm achieves an analogous round complexity speed-up for computing a $(1+ε)$-approximate maximum matching in both the Massively Parallel Computation (MPC) and CONGEST models. The data structures maintained by our algorithm are formulated using blossom notation and represented through alternating trees. This approach enables a simplified correctness analysis by treating specific components as if operating on bipartite graphs, effectively circumventing certain technical intricacies present in prior work. |
| title | Faster Semi-streaming Matchings via Alternating Trees |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2412.19057 |