The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential

J Cohen, J Lefèvre, K Maâmra, G Manoussakis… - arXiv preprint arXiv …, 2016 - arxiv.org
Manne et al. designed the first algorithm computing a maximal matching that is a 2/3-
approximation of the maximum matching in $ O (^ 2n) $ moves. However, the complexity
tightness was not proved. In this paper, we exhibit a sub-exponential execution of this
matching algorithm.

The Mann et al. self-stabilizing 2/3− approximation matching algorithm is sub-exponential.

J Cohen, K Maâmra, L Pilard, G Manoussakis - 2016 - hal.science
Mann et al.[11] designed the first algorithm computing a maximal matching that is a 2/3-
approximation of the maximum matching in 2^ O (n) moves. However, the complexity
tightness was not proved. In this paper, we exhibit a sub-exponential execution of this
matching algorithm: this algorithm can stabilize after at most Ω (2^{sqrt (n)} moves under the
central daemon.
以上显示的是最相近的搜索结果。 查看全部搜索结果