(1 + ∊)-Approximate Incremental Matching in Constant Deterministic Amortized Time [chapter]

Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn,, Shay Solomon
2019 Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms  
We study the matching problem in the incremental setting, where we are given a sequence of edge insertions and aim at maintaining a near-maximum cardinality matching of the graph with small update time. We present a deterministic algorithm that, for any constant ε > 0, maintains a (1 + ε)approximate matching with constant amortized update time per insertion.
doi:10.1137/1.9781611975482.114 dblp:conf/soda/0001LSSS19 fatcat:u4n2qalic5gzrhjjcqby66gx6e