Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
Abstract
We present dynamic algorithms with polylogarithmic update time for estimating the size of the maximum matching of a graph undergoing edge insertions and deletions with approximation ratio strictly better than 2. Specifically, we obtain a \(1+\tfrac{1}{\sqrt {2}}+\epsilon \approx 1.707+\epsilon\) approximation in bipartite graphs and a \(1.973+\epsilon\) approximation in general graphs. We thus answer in the affirmative the value version of the major open question repeatedly asked in the dynamic graph algorithms literature. Our randomized algorithms’ approximation and worst-case update time bounds both hold w.h.p. against adaptive adversaries.
Our algorithms are based on simulating new two-pass streaming matching algorithms in the dynamic setting. Our key new idea is to invoke the recent sublinear-time matching algorithm of Behnezhad (FOCS’21) in a white-box manner to efficiently simulate the second pass of our streaming algorithms, while bypassing the well-known vertex-update barrier.
References
[1]
Amir Abboud and Søren Dahlgaard. 2016. Popular conjectures as a barrier for dynamic planar graph algorithms. In Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS). 477–486.
[2]
Amir Abboud and Virginia Vassilevska Williams. 2014. Popular conjectures imply strong lower bounds for dynamic problems. In Proceedings of the 55th Symposium on Foundations of Computer Science (FOCS). 434–443.
[3]
Kook Jin Ahn and Sudipto Guha. 2013. Linear programming in the semi-streaming model with application to the maximum matching problem. Information and Computation 222 (2013), 59–79.
[4]
Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, and David Wajc. 2018. Dynamic matching: Reducing integral algorithms to approximately-maximal fractional algorithms. In Proceedings of the 45th International Colloquium on Automata, Languages and Programming (ICALP). 79:1–79:16.
[5]
Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, and Huan Li. 2023. On regularity lemma and barriers in streaming and dynamic matching. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC). 131–144.
[6]
Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, and Kevin Tian. 2022. Semi-streaming bipartite matching in fewer passes and optimal space. In Proceedings of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 627–669.
[7]
Sepehr Assadi and Sanjeev Khanna. 2024. Improved bounds for fully dynamic matching via ordered ruzsa-szemerédi graphs. arXiv preprint arXiv:2406.13573 (2024).
[8]
Sepehr Assadi, Sanjeev Khanna, and Yang Li. 2019. The stochastic matching problem with (very) few queries. ACM Transactions on Economics and Computation (TEAC) 7, 3 (2019), 1–19.
[9]
Sepehr Assadi, Sanjeev Khanna, Yang Li, and Grigory Yaroslavtsev. 2016. Maximum matchings in dynamic graph streams and the simultaneous communication model. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1345–1364.
[10]
Amir Azarmehr, Soheil Behnezhad, and Mohammad Roghani. 2024. Fully dynamic matching: \((2-\sqrt {2})\) -Approximation in polylog update time. In Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 3040–3061.
[11]
Surender Baswana, Manoj Gupta, and Sandeep Sen. 2015. Fully dynamic maximal matching in \({O}(\log n)\) update time. SIAM Journal on Computing (SICOMP) 44, 1 (2015), 88–113.
[12]
Soheil Behnezhad. 2022. Time-optimal sublinear algorithms for matching and vertex cover. In Proceedings of the 62nd Symposium on Foundations of Computer Science (FOCS). 873–884.
[13]
Soheil Behnezhad. 2023. Dynamic algorithms for maximum matching size. In Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 129–162.
[14]
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, and Madhu Sudan. 2019. Fully dynamic maximal independent set with polylogarithmic update time. In Proceedings of the 60th Symposium on Foundations of Computer Science (FOCS). 382–405.
[15]
Soheil Behnezhad and Alma Ghafari. 2024. Fully dynamic matching and ordered ruzsa-szemerédi graphs. In Proceedings of the 65th Symposium on Foundations of Computer Science (FOCS). To appear.
[16]
Soheil Behnezhad and Sanjeev Khanna. 2022. New trade-offs for fully dynamic matching via hierarchical EDCS. In Proceedings of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 3529–3566.
[17]
Soheil Behnezhad, Jakub Łącki, and Vahab Mirrokni. 2020. Fully dynamic matching: Beating 2-approximation in \({\Delta }^{\epsilon }\) update time. In Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2492–2508.
[18]
Soheil Behnezhad, Mohammad Roghani, and Aviad Rubinstein. 2023. Sublinear time algorithms and complexity of approximate maximum matching. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC). 267–280.
[19]
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, and Uri Stemmer. 2022. Dynamic algorithms against an adaptive adversary: Generic constructions and lower bounds. In Proceedings of the 54th Annual ACM Symposium on Theory of Computing (STOC). 1671–1684.
[20]
Aaron Bernstein, Aditi Dudeja, and Zachary Langley. 2021. A framework for dynamic matching in weighted graphs. In Proceedings of the 53rd Annual ACM Symposium on Theory of Computing (STOC). 668–681.
[21]
Aaron Bernstein, Sebastian Forster, and Monika Henzinger. 2019. A deamortization approach for dynamic spanner and dynamic maximal matching. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1899–1918.
[22]
Aaron Bernstein and Cliff Stein. 2015. Fully dynamic matching in bipartite graphs. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP). 167–179.
[23]
Aaron Bernstein and Cliff Stein. 2016. Faster fully dynamic matchings with small approximation ratios. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 692–711.
[24]
Sayan Bhattacharya, Deeparnab Chakrabarty, and Monika Henzinger. 2020. Deterministic dynamic matching in \({O}(1)\) update time. Algorithmica 82, 4 (2020), 1057–1080.
[25]
Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing (SICOMP) 47, 3 (2018), 859–887.
[26]
Sayan Bhattacharya, Monika Henzinger, and Danupon Nanongkai. 2016. New deterministic approximation algorithms for fully dynamic matching. In Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC). 398–411.
[27]
Sayan Bhattacharya, Monika Henzinger, and Danupon Nanongkai. 2017. Fully dynamic approximate maximum matching and minimum vertex cover in \({O} (\log ^3 n)\) worst case update time. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 470–489.
[28]
Sayan Bhattacharya and Peter Kiss. 2021. Deterministic rounding of dynamic fractional matchings. In Proceedings of the 48th International Colloquium on Automata, Languages and Programming (ICALP). 27:1–27:14.
[29]
Sayan Bhattacharya, Peter Kiss, and Thatchaphol Saranurak. 2023. Sublinear algorithms for (1.5+ \(\epsilon\) )-approximate matching. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC). 254–266.
[30]
Sayan Bhattacharya, Peter Kiss, and Thatchaphol Saranurak. 2024. Dynamic \((1+\epsilon)\) -Approximate matching size in truly sublinear update time. In Proceedings of the 56th Symposium on Foundations of Computer Science (FOCS). 1563–1588.
[31]
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, and David Wajc. 2023. Dynamic matching with better-than-2 approximation in polylogarithmic update time. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 100–128.
[32]
Sayan Bhattacharya, Peter Kiss, Aaron Sidford, and David Wajc. 2024. Near-optimal dynamic rounding of fractional matchings in bipartite graphs. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC). 59–70.
[33]
Sayan Bhattacharya and Janardhan Kulkarni. 2019. Deterministically maintaining a \((2+\epsilon)\) -approximate minimum vertex cover in \({O}(1/\epsilon ^2)\) amortized update time. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1872–1885.
[34]
Jan van den Brand, Danupon Nanongkai, and Thatchaphol Saranurak. 2019. Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds. In Proceedings of the 60th Symposium on Foundations of Computer Science (FOCS). 456–480.
[35]
Moses Charikar and Shay Solomon. 2018. Fully dynamic almost-maximal matching: Breaking the polynomial barrier for worst-case time bounds. In Proceedings of the 45th International Colloquium on Automata, Languages and Programming (ICALP). 33:1–33:14.
[36]
Shiri Chechik and Tianyi Zhang. 2019. Fully dynamic maximal independent set in expected poly-log update time. In Proceedings of the 60th Symposium on Foundations of Computer Science (FOCS). 370–381.
[37]
Jiale Chen, Aaron Sidford, and Ta-Wei Tu. 2023. Entropy regularization and faster decremental matching in general graphs. arXiv preprint arXiv:2312.09077 (2023).
[38]
Julia Chuzhoy and Sanjeev Khanna. 2019. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. In Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC). 389–400.
[39]
Michael Crouch and Daniel M. Stubbs. 2014. Improved streaming algorithms for weighted matching, via unweighted matching. In Proceedings of the 17th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). 96.
[40]
Søren Dahlgaard. 2016. On the hardness of partially dynamic graph problems and connections to diameter. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP). 48:1–48:14.
[41]
Ran Duan and Seth Pettie. 2014. Linear-time approximation for maximum weight matching. Journal of the ACM (JACM) 61, 1 (2014), 1.
[42]
Devdatt P. Dubhashi and Desh Ranjan. 1998. Balls and bins: A study in negative dependence. Random Struct. Algorithms 13, 2 (1998), 99–124.
[43]
Aditi Dudeja. 2024. A note on rounding matchings in general graphs. arXiv preprint arXiv:2402.03068 (2024).
[44]
Jack Edmonds. 1965. Maximum matching and a polyhedron with 0, 1-vertices. Journal of Research of the National Bureau of Standards B 69, 125-130 (1965), 55–56.
[45]
Jack Edmonds. 1965. Paths, trees, and flowers. Canadian Journal of Mathematics 17, 3 (1965), 449–467.
[46]
Sebastian Eggert, Lasse Kliemann, and Anand Srivastav. 2009. Bipartite graph matchings in the semi-streaming model. In Proceedings of the 16th Annual European Symposium on Algorithms (ESA). 492–503.
[47]
Leah Epstein, Asaf Levin, Danny Segev, and Oren Weimann. 2013. Improved bounds for online preemptive matching. In Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS). 389.
[48]
Hossein Esfandiari, MohammadTaghi Hajiaghayi, and Morteza Monemizadeh. 2016. Finding large matchings in semi-streaming. In 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW). 608–614.
[49]
Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, and Shen Chen Xu. 2018. Graph sketching against adaptive adversaries applied to the minimum degree algorithm. In Proceedings of the 59th Symposium on Foundations of Computer Science (FOCS). 101–112.
[50]
Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang. 2005. On graph problems in a semi-streaming model. Theoretical Computer Science (TCS) 348, 2-3 (2005), 207–216.
[51]
Moran Feldman and Ariel Szarf. 2022. Maximum matching sans maximal matching: A new approach for finding maximum matchings in the data stream model. In Proceedings of the 25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). 33:1–33:24.
[52]
Manuela Fischer, Slobodan Mitrović, and Jara Uitto. 2022. Deterministic \((1+ \epsilon)\) -approximate maximum matching with poly \((1/\epsilon)\) passes in the semi-streaming model and beyond. In Proceedings of the 54th Annual ACM Symposium on Theory of Computing (STOC). 248–260.
[53]
Mohsen Ghaffari and David Wajc. 2019. Simplified and space-optimal semi-streaming \((2+ \epsilon)\) -approximate matching. In Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA). 13:1–13:8.
[54]
Ashish Goel, Michael Kapralov, and Sanjeev Khanna. 2012. On the communication and streaming complexity of maximum bipartite matching. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 468–485.
[55]
Ashish Goel, Michael Kapralov, and Sanjeev Khanna. 2013. Perfect matchings in \({O}(n \log n)\) time in regular bipartite graphs. SIAM Journal on Computing (SICOMP) 42, 3 (2013), 1392–1404.
[56]
Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, and Amitai Uzrad. 2022. Maintaining an EDCS in general graphs: Simpler, density-sensitive and with worst-case time bounds. Proceedings of the 5th Symposium on Simplicity in Algorithms (SOSA) (2022), 12–23.
[57]
Manoj Gupta and Richard Peng. 2013. Fully dynamic \((1+\epsilon)\) -approximate matchings. In Proceedings of the 54th Symposium on Foundations of Computer Science (FOCS). 548–557.
[58]
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. 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). 21–30.
[59]
Sagar Kale and Sumedh Tirodkar. 2017. Maximum matching in two, three, and a few more passes over graph streams. In Proceedings of the 20th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). 15:1–15:21.
[60]
Michael Kapralov. 2013. Better bounds for matchings in the streaming model. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1679–1697.
[61]
Michael Kapralov. 2021. Space lower bounds for approximating maximum matching in the edge arrival model. In Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1874–1893.
[62]
Peter Kiss. 2022. Improving update times of dynamic matching algorithms from amortized to worst case. Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS) (2022), 94:1–94:21.
[63]
Christian Konrad. 2018. A simple augmentation method for matchings with applications to streaming algorithms. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS). 74:1–74:16.
[64]
Christian Konrad, Frédéric Magniez, and Claire Mathieu. 2012. Maximum matching in semi-streaming with few passes. In Proceedings of the 15th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). 231–242.
[65]
Christian Konrad and Kheeran K. Naidu. 2021. On two-pass streaming algorithms for maximum bipartite matching. In Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). 19:1–19:18.
[66]
Tsvi Kopelowitz, Seth Pettie, and Ely Porat. 2016. Higher lower bounds from the 3SUM conjecture. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1272–1287.
[67]
Harold W. Kuhn. 1955. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 1-2 (1955), 83–97.
[68]
Hung Le, Lazar Milenković, Shay Solomon, and Virginia Vassilevska Williams. 2022. Dynamic matching algorithms under vertex updates. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS). 96:1–96:24.
[69]
Yang P. Liu. 2024. On approximate fully-dynamic matching and online matrix-vector multiplication. In Proceedings of the 65th Symposium on Foundations of Computer Science (FOCS). To appear.
[70]
Andrew McGregor. 2005. Finding graph matchings in data streams. In Proceedings of the 8th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). 170–181.
[71]
Danupon Nanongkai and Thatchaphol Saranurak. 2017. Dynamic spanning forest with worst-case update time: Adaptive, Las Vegas, and \({O} (n^{1/2-\varepsilon })\) -time. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC). 1122–1129.
[72]
Huy N. Nguyen and Krzysztof Onak. 2008. Constant-time approximation algorithms via local improvements. In Proceedings of the 49th Symposium on Foundations of Computer Science (FOCS). 327–336.
[73]
Krzysztof Onak, Dana Ron, Michal Rosen, and Ronitt Rubinfeld. 2012. A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1123–1131.
[74]
Krzysztof Onak and Ronitt Rubinfeld. 2010. Maintaining a large matching and a small vertex cover. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC). 457–464.
[75]
Michal Parnas and Dana Ron. 2007. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theoretical Computer Science (TCS) 381, 1-3 (2007), 183–196.
[76]
Ami Paz and Gregory Schwartzman. 2018. A \((2+\epsilon)\) -approximation for maximum weight matching in the semi-streaming model. ACM Transactions on Algorithms (TALG) 15, 2 (2018), 18.
[77]
David Peleg and Shay Solomon. 2016. Dynamic \((1+ \epsilon)\) -approximate matchings: A density-sensitive approach. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 712–729.
[78]
Mohammad Roghani, Amin Saberi, and David Wajc. 2022. Beating the folklore algorithm for dynamic matching. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS). 111:1–111:23.
[79]
Piotr Sankowski. 2007. Faster dynamic matchings and vertex connectivity. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 118–126.
[80]
Shay Solomon. 2016. Fully dynamic maximal matching in constant update time. In Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS). 325–334.
[81]
Vadim G. Vizing. 1964. On an estimate of the chromatic class of a p-graph. Diskret Analiz 3 (1964), 25–30.
[82]
David Wajc. 2020. Rounding dynamic matchings against an adaptive adversary. In Proceedings of the 52nd Annual ACM Symposium on Theory of Computing (STOC). 194–207.
[83]
Yuichi Yoshida, Masaki Yamamoto, and Hiro Ito. 2012. Improved constant-time approximation algorithms for maximum matchings and other optimization problems. SIAM Journal on Computing (SICOMP) 41, 4 (2012), 1074–1093.
Index Terms
- Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
Recommendations
Deterministic Dynamic Matching in Worst-Case Update Time
AbstractWe present deterministic algorithms for maintaining a and -approximate maximum matching in a fully dynamic graph with worst-case update times and respectively. The fastest known deterministic worst-case update time ...
Deterministic Dynamic Matching in O(1) Update Time
AbstractWe consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld (in: ...
Distributed Approximate Matching
We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized $(4+\epsilon)$-approximation distributed algorithm for maximum weighted matching, whose running time is $O(\log n)$ for any constant $\...
Comments
Information & Contributors
Information
Published In
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 October 2024
Online AM: 23 July 2024
Accepted: 15 July 2024
Revised: 12 May 2024
Received: 10 August 2023
Published in JACM Volume 71, Issue 5
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Engineering and Physical Sciences Research Council, UK (EPSRC)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 47Total Downloads
- Downloads (Last 12 months)47
- Downloads (Last 6 weeks)22
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in