Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
Abstract
The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the data stream model, the state-of-the-art single-pass semi-streaming algorithm for it is still a simple greedy algorithm that computes a maximal matching, and this way obtains -approximation. Some previous works described two/three-pass algorithms that improve over this approximation ratio by using their second and third passes to improve the above mentioned maximal matching. One contribution of this paper continues this line of work by presenting new three-pass semi-streaming algorithms that work along these lines and obtain improved approximation ratios of 0.6111 and 0.5694 for triangle-free and general graphs, respectively. Unfortunately, a recent work Konrad and Naidu (Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX/RANDOM 2021, August 16–18, 2021. LIPIcs, vol 207, pp 19:1–19:18, 2021. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.19) shows that the strategy of constructing a maximal matching in the first pass and then improving it in further passes has limitations. Additionally, this technique is unlikely to get us closer to single-pass semi-streaming algorithms obtaining a better than -approximation. Therefore, it is interesting to come up with algorithms that do something else with their first pass (we term such algorithms non-maximal-matching-first algorithms). No such algorithms were previously known, and the main contribution of this paper is describing such algorithms that obtain approximation ratios of 0.5384 and 0.5555 in two and three passes, respectively, for general graphs. The main significance of our results is not in the numerical improvements, but in demonstrating the potential of non-maximal-matching-first algorithms.
References
[1]
Konrad, C., Naidu, K.K.: On two-pass streaming algorithms for maximum bipartite matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16–18, 2021. LIPIcs, vol. 207 (2021), pp. 19:1–19:18.
[2]
Balinski ML and Gonzalez J Maximum matchings in bipartite graphs via strong spanning trees Networks 1991 21 2 165-179
[3]
Edmonds J Maximum matching and a polyhedron with 0, 1-vertices J. Res. Natl. Bureau Stand. B 1965 69 125–130 55-56
[4]
Hopcroft JE and Karp RM An algorithm for maximum matchings in bipartite graphs SIAM J. Comput. 1973 2 4 225-231
[5]
Feigenbaum J, Kannan S, McGregor A, Suri S, and Zhang J On graph problems in a semi-streaming model Theor. Comput. Sci. 2005 348 2–3 207-216
[6]
Kapralov, M.: 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, January 10–13, 2021 (2021), pp. 1874–1893.
[7]
Goel, A., Kapralov, M., Khanna, S.: On the communication and streaming complexity of maximum bipartite matching. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2012), pp. 468–485.
[8]
Kapralov, M.: Better bounds for matchings in the streaming model. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2013), pp. 1679–1697.
[9]
Konrad, C.: A simple augmentation method for matchings with applications to streaming algorithms. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS). LIPIcs, vol. 117 (2018), pp. 74:1–74:16.
[10]
Kale, S., Tirodkar, S.: Maximum matching in two, three, and a few more passes over graph streams. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. LIPIcs, vol. 81 (2017), pp. 15:1–15:21.
[11]
Konrad, C., Magniez, F., Mathieu, C.: Maximum matching in semi-streaming with few passes. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques—15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15–17, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7408, pp. 231–242 (2012).
[12]
Esfandiari, H., Hajiaghayi, M., Monemizadeh, M.: Finding large matchings in semi-streaming. In: Domeniconi, C., Gullo, F., Bonchi, F., Domingo-Ferrer, J., Baeza-Yates, R., Zhou, Z., Wu, X. (eds.) IEEE International Conference on Data Mining Workshops, ICDM Workshops 2016, December 12–15, 2016, Barcelona, Spain, pp. 608–614. IEEE Computer Society (2016).
[13]
Assadi, S.: A two-pass (conditional) lower bound for semi-streaming maximum matching. In: Naor, J.S., Buchbinder, N. (eds.) ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 708–742. SIAM (2022).
[14]
Azarmehr, A., Behnezhad, S., Roghani, M.: Fully dynamic matching: (2-2)-approximation in polylog update time. CoRR arXiv:abs/2307.08772 (2023).
[15]
Kapralov, M., Khanna, S., Sudan, M.: Approximating matching size from random streams. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2014), pp. 734–751.
[16]
Cormode, G., Jowhari, H., Monemizadeh, M., Muthukrishnan, S.: The sparse awakens: streaming algorithms for matching size estimation in sparse graphs. In: 25th Annual European Symposium on Algorithms, ESA 2017, September 4–6, 2017, Vienna, Austria. LIPIcs, vol. 87, pp. 29:1–29:15 (2017).
[17]
Esfandiari H, Hajiaghayi M, Liaghat V, Monemizadeh M, and Onak K Streaming algorithms for estimating the matching size in planar graphs and beyond ACM Trans. Algorithms 2018 14 4 48:1-48:23
[18]
McGregor, A., Vorotnikova, S.: Planar matching in streams revisited. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pp. 17:1–17:12 (2016).
[19]
McGregor, A., Vorotnikova, S.: A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs. In: 1st Symposium on Simplicity in Algorithms (SOSA). OASICS, vol. 61, pp. 14:1–14:4 (2018).
[20]
Assadi, S., Khanna, S., Li, Y.: On estimating maximum matching size in graph streams. In: Klein, P.N. (ed) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16–19, pp. 1723–1742. SIAM (2017).
[21]
Assadi, S., Kol, G., Saxena, R.R., Yu, H.: Multi-pass graph streaming lower bounds for cycle counting, max-cut, matching size, and other problems. In: Irani, S. (ed) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16–19, 2020, pp. 354–364. IEEE (2020).
[22]
Assadi, S., N, V.: Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma. In: Khuller, S., Williams, V.V. (eds.) STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, June 21–25, 2021, pp. 612–625. ACM (2021).
[23]
Chitnis, R., Cormode, G., Esfandiari, H., Hajiaghayi, M., McGregor, A., Monemizadeh, M., Vorotnikova, S.: Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2016), pp. 1326–1344.
[24]
Assadi, S., Behnezhad, S., Khanna, S., Li, H.: On regularity lemma and barriers in streaming and dynamic matching. In: Saha, B., Servedio, R.A. (eds.) 55th Annual ACM Symposium on Theory of Computing (STOC), pp. 131–144. ACM (2023).
[25]
McGregor, A.: Finding graph matchings in data streams. In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) and 9th International Workshop on Randomization and Computation (RANDOM) (2005), pp. 170–181.
[26]
Ahn KJ and Guha S Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints ACM Trans. Parallel Comput. 2018 4 4 17:1-17:40
[27]
Assadi, S., Jambulapati, A., Jin, Y., Sidford, A., Tian, K.: Semi-streaming bipartite matching in fewer passes and optimal space. arXiv e-prints pp. arXiv–2011 (2020)
[28]
Assadi, S., Liu, S.C., Tarjan, R.E.: An auction algorithm for bipartite matching in streaming and massively parallel computation models. In: 4th Symposium on Simplicity in Algorithms (SOSA), pp. 165–171 (2021).
[29]
Fischer, M., Mitrovic, S., Uitto, J.: Deterministic (1+)-approximate maximum matching with poly(1/) passes in the semi-streaming model and beyond. In: Leonardi, S., Gupta, A. (eds.) STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20–24, 2022, pp. 248–260. ACM (2022).
[30]
Huang, S., Su, H.: -approximate maximum weighted matching in poly time in the distributed and parallel settings. In: Oshman, R., Nolin, A., Halldórsson, M.M., Balliu, A. (eds.), ACM Symposium on Principles of Distributed Computing (PODC), pp. 44–54. ACM (2023).
[31]
Assadi, S.: A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching. CoRR arXiv:abs/2307.02968 (2023).
[32]
Assadi, S., Behnezhad, S.: Beating two-thirds for random-order streaming matching. In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12–16, 2021. LIPIcs, vol. 198, pp. 19:1–19:13 (2021).
[33]
Bernstein, A.: Improved bounds for matching in random-order streams. In: Czumaj, A. Dawar, A., Merelli, E. (eds.) 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8–11, 2020, Saarbrücken, Germany. LIPIcs, vol. 168, (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020), pp. 12:1–12:13.
[34]
Crouch, M.S., Stubbs, D.M.: Improved streaming algorithms for weighted matching, via unweighted matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM). LIPIcs, vol. 28, pp. 96–104 (2014).
[35]
Epstein L, Levin A, Mestre J, and Segev D Improved approximation guarantees for weighted matching in the semi-streaming model SIAM J. Discrete Math. 2011 25 3 1251-1265
[36]
Zelke M Weighted matching in the semi-streaming model Algorithmica 2012 62 1–2 1-20
[37]
Paz A and Schwartzman G A ()-approximation for maximum weight matching in the semi-streaming model ACM Trans. Algorithms 2019 15 2 18:1-18:15
[38]
Bernstein, A., Dudeja, A., Langley, Z.: A framework for dynamic matching in weighted graphs. In: Khuller, S., Williams, V.V. (eds.) STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, June 21–25, 2021, pp. 668–681. ACM (2021).
Recommendations
A (2+ϵ)-Approximation for Maximum Weight Matching in the Semi-streaming Model
Special Issue on Soda'17 and Regular PapersWe present a simple deterministic single-pass (2+ϵ)-approximation algorithm for the maximum weight matching problem in the semi-streaming model. This improves on the currently best known approximation ratio of (4+ϵ).
Our algorithm uses O(nlog2 n) bits ...
Distributed Maximum Matching in Bounded Degree Graphs
ICDCN '15: Proceedings of the 16th International Conference on Distributed Computing and NetworkingWe present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least (1−ϵ) times the optimal in ...
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of ComputingSublinear time algorithms for approximating maximum matching size have long been studied. Much of the progress over the last two decades on this problem has been on the algorithmic side. For instance, an algorithm of [Behnezhad; FOCS’21] obtains a 1/2-...
Comments
Information & Contributors
Information
Published In
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 28 November 2023
Accepted: 06 November 2023
Received: 20 October 2022
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Sep 2024
Other Metrics
Citations
View Options
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