Erratum to: Greedy Matching: Guarantees and Limitations

Abstract

In “Greedy Matching: Guarantees and Limitations” we erroneously claimed in Theorem 5 that no fully randomized priority algorithm for the maximum matching problem can achieve an expected approximation ratio better than \(\frac{5}{6}\). This bound and the provided argument hold for degree-based randomized priority algorithms. For fully randomized priority algorithms we show a \((1 - c)\)-hardness bound for a small constant c. Thus, the central conclusion that these myopic algorithms cannot guarantee a maximum matching remains valid.