(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time

Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationSODA 2019
Pages1886-1898
Number of pages13
StatePublished - 2019
Event30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States
Duration: 6 Jan 20199 Jan 2019

Conference

Conference30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
Country/TerritoryUnited States
CitySan Diego
Period6/01/199/01/19

Fingerprint

Dive into the research topics of '(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time'. Together they form a unique fingerprint.

Cite this