The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential
Distributed, Parallel, and Cluster Computing
2017-04-19 v3
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.
Keywords
Cite
@article{arxiv.1604.08066,
title = {The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential},
author = {Johanne Cohen and Jonas Lefèvre and Khaled Maâmra and George Manoussakis and Laurence Pilard},
journal= {arXiv preprint arXiv:1604.08066},
year = {2017}
}