Go to APPROX 2013 homepageA Local Computation Approximation Scheme to Maximum Matching
Abstract: We present a polylogarithmic local computation matching algorithm which guarantees a (1 - ε)-approximation to the maximum matching in graphs of bounded degree.
0 Replies
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview