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