Deterministic (1+Ξ΅)-Approximate Maximum Matching with πππ π(1/Ξ΅) Passes in the Semi-Streaming Model
We present a deterministic (1+Ξ΅)-approximate maximum matching algorithm in πππ π(1/Ξ΅) passes in the semi-streaming model, solving the long-standing open problem of breaking the exponential barrier in the dependence on 1/Ξ΅. Our algorithm exponentially improves on the well-known randomized (1/Ξ΅)^O(1/Ξ΅)-pass algorithm from the seminal work by McGregor [APPROX05], the recent deterministic algorithm by Tirodkar with the same pass complexity [FSTTCS18], as well as the deterministic log n Β·πππ π(1/Ξ΅)-pass algorithm by Ahn and Guha [ICALP11].
READ FULL TEXT