Improved Algorithm for Dynamic b-Matching
Recently there has been extensive work on maintaining (approximate) maximum matchings in dynamic graphs. We consider a generalisation of this problem known as the maximum b-matching: Every node v has a positive integral capacity b_v, and the goal is to maintain an (approximate) maximum-cardinality subset of edges that contains at most b_v edges incident on every node v. The maximum matching problem is a special case of this problem where b_v = 1 for every node v.
Bhattacharya, Henzinger and Italiano [ICALP 2015] showed how to maintain a O(1) approximate maximum b-matching in a graph in O(log^3 n) amortised update time. Their approximation ratio was a large (double digit) constant. We significantly improve their result both in terms of approximation ratio as well as update time. Specifically, we design a randomised dynamic algorithm that maintains a (2+epsilon)-approximate maximum $b$-matching in expected amortised O(1/epsilon^4) update time. Thus, for every constant epsilon in (0, 1), we get expected amortised O(1) update time. Our algorithm generalises the framework of Baswana, Gupta, Sen [FOCS 2011] and Solomon [FOCS 2016] for maintaining a maximal matching in a dynamic graph.
dynamic data structures
graph algorithms
15:1-15:13
Regular Paper
Sayan
Bhattacharya
Sayan Bhattacharya
Manoj
Gupta
Manoj Gupta
Divyarthi
Mohan
Divyarthi Mohan
10.4230/LIPIcs.ESA.2017.15
S. Baswana, M. Gupta, and S. Sen. Fully dynamic maximal matching in O(log n) update time. In FOCS 2011, 2011.
Aaron Bernstein and Cliff Stein. Fully dynamic matching in bipartite graphs. In ICALP 2015, 2015.
Aaron Bernstein and Cliff Stein. Faster fully dynamic matchings with small approximation ratios. In SODA 2016, 2016.
Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. Design of dynamic algorithms via primal-dual method. In ICALP 2015, 2015.
Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. Deterministic fully dynamic data structures for vertex cover and matching. In SODA 2015, 2015.
Sayan Bhattacharya, Monika Henzinger, and Danupon Nanongkai. New deterministic approximation algorithms for fully dynamic matching. In STOC 2016, 2016.
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, and Debmalya Panigrahi. Online and dynamic algorithms for set cover. In STOC 2017, 2017.
Manoj Gupta and Richard Peng. Fully dynamic (1+ε)-approximate matchings. In FOCS 2013, 2013.
Ofer Neiman and Shay Solomon. Simple deterministic algorithms for fully dynamic maximal matching. In STOC 2013, 2013.
Krzysztof Onak and Ronitt Rubinfeld. Maintaining a large matching and a small vertex cover. In STOC 2010, 2010.
David Peleg and Shay Solomon. Dynamic (1+ε)-approximate matchings: A density-sensitive approach. In SODA 2016, 2016.
Shay Solomon. Fully dynamic maximal matching in constant update time. In FOCS 2016, 2016.
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode