A Local Computation Approximation Scheme to Maximum MatchingDownload PDFOpen Website

2013 (modified: 05 Nov 2022)CoRR 2013Readers: Everyone
Abstract: We present a polylogarithmic local computation matching algorithm which guarantees a $(1-\eps)$-approximation to the maximum matching in graphs of bounded degree.
0 Replies

Loading