Sayan Bhattacharya
Danupon Nanongkai
ABSTRACT
We present two deterministic dynamic algorithms for the maximum matching problem. (1) An algorithm that maintains a (2+є)-approximate maximum matching in general graphs with O(poly(logn, 1/є)) update time. (2) An algorithm that maintains an αK approximation of the value of the maximum matching with O(n2/K) update time in bipartite graphs, for every sufficiently large constant positive integer K. Here, 1≤ αK < 2 is a constant determined by the value of K. Result (1) is the first deterministic algorithm that can maintain an o(logn)-approximate maximum matching with polylogarithmic update time, improving the seminal result of Onak et al. [STOC 2010]. Its approximation guarantee almost matches the guarantee of the best randomized polylogarithmic update time algorithm [Baswana et al. FOCS 2011]. Result (2) achieves a better-than-two approximation with arbitrarily small polynomial update time on bipartite graphs. Previously the best update time for this problem was O(m1/4) [Bernstein et al. ICALP 2015], where m is the current number of edges in the graph.
- A. Abboud and V. Vassilevska Williams. Popular conjectures imply strong lower bounds for dynamic problems. In FOCS, 2014. Google Scholar
Digital Library
- S. Baswana, M. Gupta, and S. Sen. Fully dynamic maximal matching in O(log n) update time. In FOCS, 2011. Google ScholarDigital Library
- A. Bernstein and C. Stein. Fully dynamic matching in bipartite graphs. In ICALP, 2015.Google ScholarCross Ref
- A. Bernstein and C. Stein. Faster fully dynamic matchings with small approximation ratios. In SODA, 2016. Google ScholarDigital Library
- S. Bhattacharya, M. Henzinger, and G. F. Italiano. Deterministic fully dynamic data structures for vertex cover and matching. CoRR, abs/1412.1318, 2014. Google ScholarDigital Library
- Announced at SODA 2015.Google Scholar
- M. Crouch and D. S. Stubbs. Improved streaming algorithms for weighted matching, via unweighted matching. In APPROX/RANDOM, 2014.Google Scholar
- M. Gupta and R. Peng. Fully dynamic (1 + )-approximate matchings. In FOCS, 2013. Google ScholarDigital Library
- M. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In STOC, 2015. Google ScholarDigital Library
- A. Israeli and Y. Shiloach. An improved parallel algorithm for maximal matching. Information Processing Letters, 22:57–60, 1986. Google ScholarDigital Library
- C. Konrad, F. Magniez, and C. Mathieu. Maximum matching in semi-streaming with few passes. In APPROX-RANDOM, 2012.Google ScholarCross Ref
- T. Kopelowitz, S. Pettie, and E. Porat. Higher lower bounds from the 3SUM conjecture. In SODA, 2016. Google ScholarDigital Library
- O. Neiman and S. Solomon. Simple deterministic algorithms for fully dynamic maximal matching. In STOC, 2013. Google ScholarDigital Library
- K. Onak and R. Rubinfeld. Maintaining a large matching and a small vertex cover. In STOC, 2010. Google ScholarDigital Library
- M. Patrascu. Towards polynomial lower bounds for dynamic problems. In STOC, 2010. Google ScholarDigital Library
- D. Peleg and S. Solomon. Dynamic (1 + )-approximate matchings: A density-sensitive approach. In SODA, 2016. Google ScholarDigital Library
- P. Sankowski. Faster dynamic matchings and vertex connectivity. In SODA, 2007. Google ScholarDigital Library
- V. G. Vizing. The chromatic class of a multigraph. Kibernetika, 3:29–39, 1965.Google Scholar
Index Terms
- New deterministic approximation algorithms for fully dynamic matching
Recommendations
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
Special Issue on SODA'12 and Regular PapersA maximal matching can be maintained in fully dynamic (supporting both addition and deletion of edges) n-vertex graphs using a trivial deterministic algorithm with a worst-case update time of O(n). No deterministic algorithm that outperforms the naïve O(...
Improved Data Structures for Fully Dynamic Biconnectivity
We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs.A fully dynamic algorithm maintains a graph during a sequence of insertions and deletions of edges or isolated vertices. Let m be the number of ...
Simple deterministic algorithms for fully dynamic maximal matching
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingA maximal matching can be maintained in fully dynamic (supporting both addition and deletion of edges) n-vertex graphs using a trivial deterministic algorithm with a worst-case update time of O(n). No deterministic algorithm that outperforms the naive O(...
Comments