We present the first polynomial self-stabilizing algorithm for finding a (2/3)-approximation of
a maximum matching in a general graph. The previous best known algorithm has been …