The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential
arXiv:1604.08066
Abstract
Manne et al. designed the first algorithm computing a maximal matching that is a 2/3 -approximation of the maximum matching in moves. However, the complexity tightness was not proved. In this paper, we exhibit a sub-exponential execution of this matching algorithm.