Papers
Topics
Authors
Recent
Search
2000 character limit reached

Matching Composition and Efficient Weight Reduction in Dynamic Matching

Published 24 Oct 2024 in cs.DS | (2410.18936v1)

Abstract: We consider the foundational problem of maintaining a $(1-\varepsilon)$-approximate maximum weight matching (MWM) in an $n$-node dynamic graph undergoing edge insertions and deletions. We provide a general reduction that reduces the problem on graphs with a weight range of $\mathrm{poly}(n)$ to $\mathrm{poly}(1/\varepsilon)$ at the cost of just an additive $\mathrm{poly}(1/\varepsilon)$ in update time. This improves upon the prior reduction of Gupta-Peng (FOCS 2013) which reduces the problem to a weight range of $\varepsilon{-O(1/\varepsilon)}$ with a multiplicative cost of $O(\log n)$. When combined with a reduction of Bernstein-Dudeja-Langley (STOC 2021) this yields a reduction from dynamic $(1-\varepsilon)$-approximate MWM in bipartite graphs with a weight range of $\mathrm{poly}(n)$ to dynamic $(1-\varepsilon)$-approximate maximum cardinality matching in bipartite graphs at the cost of a multiplicative $\mathrm{poly}(1/\varepsilon)$ in update time, thereby resolving an open problem in [GP'13; BDL'21]. Additionally, we show that our approach is amenable to MWM problems in streaming, shared-memory work-depth, and massively parallel computation models. We also apply our techniques to obtain an efficient dynamic algorithm for rounding weighted fractional matchings in general graphs. Underlying our framework is a new structural result about MWM that we call the "matching composition lemma" and new dynamic matching subroutines that may be of independent interest.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Maintaining approximate maximum weighted matching in fully dynamic graphs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, volume 18 of LIPIcs, pages 257–266. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. Available at https://arxiv.org/abs/1207.3976.
  2. Fully dynamic matching: (2−2)22(2-\sqrt{2})( 2 - square-root start_ARG 2 end_ARG )-approximation in polylog update time. In Proceedings of the 35th ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024. Available at https://arxiv.org/abs/2307.08772.
  3. Laminar families and metric embeddings: Non-bipartite maximum matching problem in the semi-streaming model. CoRR, abs/1104.4058, 2011. Available at https://arxiv.org/abs/1104.4058.
  4. Near linear time approximation schemes for uncapacitated and capacitated b-matching problems in nonbipartite graphs. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pages 239–258. SIAM, 2014. Available at https://arxiv.org/abs/1307.4355.
  5. Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints. ACM Trans. Parallel Comput., 4(4):17:1–17:40, 2018. Available at https://arxiv.org/abs/1307.4359.
  6. Semi-streaming bipartite matching in fewer passes and optimal space. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, pages 627–669. SIAM, 2022. Available at https://arxiv.org/abs/2011.03495.
  7. An auction algorithm for bipartite matching in streaming and massively parallel computation models. In 4th Symposium on Simplicity in Algorithms, SOSA 2021, pages 165–171. SIAM, 2021.
  8. Sepehr Assadi. A simple (1−ε)1𝜀(1-\varepsilon)( 1 - italic_ε )-approximation semi-streaming algorithm for maximum (weighted) matching. In 2024 Symposium on Simplicity in Algorithms, SOSA 2024, pages 337–354. SIAM, 2024. Available at https://arxiv.org/abs/2307.02968.
  9. A framework for dynamic matching in weighted graphs. In Proceedings of the 53rd Annual ACM Symposium on Theory of Computing, STOC 2021, pages 668–681. ACM, 2021.
  10. Soheil Behnezhad. Dynamic algorithms for maximum matching size. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, pages 129–162. SIAM, 2023. Available at https://arxiv.org/abs/2207.07607.
  11. Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, pages 1123–1134. IEEE, 2020. Available at https://arxiv.org/abs/2009.02584.
  12. Incremental (1−ε)1𝜀(1-\varepsilon)( 1 - italic_ε )-approximate dynamic matching in O⁢(poly⁢(1/ε))𝑂poly1𝜀{O}(\mathrm{poly}(1/\varepsilon))italic_O ( roman_poly ( 1 / italic_ε ) ) update time. In 31st Annual European Symposium on Algorithms, ESA 2023, volume 274 of LIPIcs, pages 22:1–22:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Available at https://arxiv.org/abs/2302.08432.
  13. Dynamic (1+ε)1𝜀(1+\varepsilon)( 1 + italic_ε )-approximate matching size in truly sublinear update time. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, pages 1563–1588. IEEE, 2023. Available at https://arxiv.org/abs/2302.05030.
  14. Dynamic algorithms for packing-covering lps via multiplicative weight updates. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, pages 1–47. SIAM, 2023. Available at https://arxiv.org/abs/2207.07519.
  15. Dynamic matching with better-than-2 approximation in polylogarithmic update time. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, pages 100–128. SIAM, 2023. Available at https://arxiv.org/abs/2207.07438.
  16. Fully dynamic matching in bipartite graphs. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, volume 9134 of Lecture Notes in Computer Science, pages 167–179. Springer, 2015. Available at https://arxiv.org/abs/1506.07076.
  17. Faster fully dynamic matchings with small approximation ratios. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pages 692–711. SIAM, 2016.
  18. Maximum flow and minimum-cost flow in almost-linear time. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, pages 612–623, 2022. Available at https://arxiv.org/abs/2203.00671.
  19. Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrier. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, volume 107 of LIPIcs, pages 33:1–33:14, 2018. Available at https://arxiv.org/abs/1711.06883.
  20. Entropy regularization and faster decremental matching in general graphs. In arXiv Preprint, 2023. Available at https://arxiv.org/abs/2312.09077.
  21. Linear-time approximation for maximum weight matching. J. ACM, 61(1):1:1–1:23, 2014.
  22. Weighted matchings via unweighted augmentations. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, pages 491–500. ACM, 2019. Available at https://arxiv.org/abs/1811.02760.
  23. (1+ε)1𝜀(1+\varepsilon)( 1 + italic_ε )-approximate incremental matching in constant deterministic amortized time. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pages 1886–1898. SIAM, 2019.
  24. Superlinear lower bounds for multipass graph processing. Algorithmica, 76(3):654–683, 2016. Available at https://arxiv.org/abs/1212.6925.
  25. Fully dynamic (1+ε)1𝜀(1+\varepsilon)( 1 + italic_ε )-approximate matchings. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, pages 548–557. IEEE Computer Society, 2013. Available at https://arxiv.org/abs/1304.0378.
  26. Manoj Gupta. Maintaining approximate maximum matching in an incremental bipartite graph in polylogarithmic update time. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, volume 29 of LIPIcs, pages 227–239, 2014.
  27. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, STOC 2015, pages 21–30, 2015. Available at https://arxiv.org/abs/1511.06773.
  28. Regularized box-simplex games and dynamic decremental bipartite matching. In 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, volume 229 of LIPIcs, pages 77:1–77:20, 2022. Available at https://arxiv.org/abs/2204.12721.
  29. Michael Kapralov. Space lower bounds for approximating maximum matching in the edge arrival model. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, pages 1874–1893. SIAM, 2021. Available at https://arxiv.org/abs/2103.11669.
  30. A decomposition theorem for maximum weight bipartite matchings. SIAM J. Comput., 31(1):18–26, 2001.
  31. Yang P. Liu. On approximate fully-dynamic matching and online matrix-vector multiplication. In 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024. IEEE, 2024. Available at https://arxiv.org/abs/2403.02582.
  32. Scalable auction algorithms for bipartite maximum matching problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, volume 275 of LIPIcs, pages 28:1–28:24, 2023. Available at https://arxiv.org/abs/2307.08979.
  33. A generalized matching reconfiguration problem. In 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, volume 185 of LIPIcs, pages 57:1–57:20, 2021. Available at https://arxiv.org/abs/1803.05825.
  34. Metatheorems for dynamic weighted matching. In 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, volume 67 of LIPIcs, pages 58:1–58:14, 2017.
  35. A deterministic almost-linear time algorithm for minimum-cost flow. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, pages 503–514, 2023. Available at https://arxiv.org/abs/2309.16629.
  36. David Wajc. Rounding dynamic matchings against an adaptive adversary. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pages 194–207. ACM, 2020. Available at https://arxiv.org/abs/1911.05545.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up