Abstract
We present two fully dynamic algorithms for maximum cardinality matching in bipartite graphs. Our main result is a deterministic algorithm that maintains a \((3/2 + \epsilon )\) approximation in worst-case update time \(O(m^{1/4}\epsilon ^{-2.5})\). This algorithm is polynomially faster than all previous deterministic algorithms for any constant approximation, and faster than all previous algorithms (randomized included) that achieve a better-than-2 approximation. We also give stronger results for bipartite graphs whose arboricity is at most \(\alpha \), achieving a \((1+ \epsilon )\) approximation in worst-case update time \(O(\alpha (\alpha + \log (n)) + \epsilon ^{-4}(\alpha + \log (n)) + \epsilon ^{-6})\), which is \(O(\alpha (\alpha + \log n))\) for constant \(\epsilon \). Previous results for small arboricity graphs had similar update times but could only maintain a maximal matching (2-approximation). All these previous algorithms, however, were not limited to bipartite graphs.
A. Bernstein—Supported in part by an NSF Graduate Fellowship and a Simons Foundation Graduate Fellowship.
C. Stein—Supported in part by NSF grants CCF-1349602 and CCF-1421161.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abboud, A., Williams, V.V.: Popular conjectures imply strong lower bounds for dynamic problems. In: Proceedings of FOCS 2014, pp. 434–443 (2014)
Baswana, S., Gupta, M., Sen, S.: Fully dynamic maximal matching in O (log n) update time. In: Proceedings of FOCS 2011, pp. 383–392 (2011)
Bhattacharya, S., Henzinger, M., Italiano, G.F.: Deterministic fully dynamic data structures for vertex cover and matching. In: SODA, pp. 785–804 (2015)
Bosek, B., Leniowski, D., Sankowski, P., Zych, A.: Online bipartite matching in offline time. In: Proceedings of FOCS 2014, pp. 384–393 (2014)
Chaudhuri, K., Daskalakis, C., Kleinberg, R.D., Lin, H.: Online bipartite perfect matching with augmentations. In: INFOCOM, pp. 1044–1052 (2009)
Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. J. ACM 61(1), 1 (2014)
Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online stochastic packing applied to display ad allocation. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 182–194. Springer, Heidelberg (2010)
Gupta, A., Kumar, A., Stein, C.: Maintaining assignments online: matching, scheduling, and flows. In: SODA, pp. 468–479 (2014)
Gupta, M., Peng, R.: Fully dynamic (1+ e)-approximate matchings. In: Proceedings of FOCS 2013, pp. 548–557 (2013)
Hitchcock, F.: The distribution of a product from several sources to numberous localities. J. Math Phys. 20, 224–230 (1941)
Hopcroft, J.E., Karp, R.M.: An \(n^{5/2}\) algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing 2, 225–231 (1973)
Ivković, Z., Lloyd, E.L.: Fully dynamic maintenance of vertex cover. In: van Leeuwen, Jan (ed.) WG 1993. LNCS, vol. 790, pp. 99–111. Springer, Heidelberg (1994)
Kantorovitch, L.: On the translocation of masses. Doklady Akad. Nauk SSSR 37, 199–201 (1942)
Kopelowitz, T., Krauthgamer, R., Porat, E., Solomon, S.: Orienting fully dynamic graphs with worst-case time bounds. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 532–543. Springer, Heidelberg (2014)
Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized on-line matching. In: Proceedings of FOCS 2005, pp. 264–273 (2005)
Nash-Williams, C.S.J.A.: Edge disjoint spanning trees of finite graphs. Journal of the London Mathematical Society 36, 445–450 (1961)
Neiman, O., Solomon, S.: Simple deterministic algorithms for fully dynamic maximal matching. In: Proceedings of STOC 2013, pp. 745–754 (2013)
Onak, K., Rubinfeld, R.: Maintaining a large matching and a small vertex cover. In: Proceedings of STOC 2010, pp. 457–464 (2010)
Sankowski, P.: Faster dynamic matchings and vertex connectivity. In: Proceedings of SODA 2007, pp. 118–126 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernstein, A., Stein, C. (2015). Fully Dynamic Matching in Bipartite Graphs. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-47672-7_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47671-0
Online ISBN: 978-3-662-47672-7
eBook Packages: Computer ScienceComputer Science (R0)