@inproceedings{e15e2bc0152542598d9d096ff05b1e69,
title = "Polynomial self-stabilizing maximum matching algorithm with approximation ratio 2/3",
abstract = "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 presented by Manne et al. [16] and has a sub-exponential time complexity under the distributed adversarial daemon [3]. Our new algorithm is an adaptation of the Manne et al. algorithm and works under the same daemon, but with a time complexity in O(n3) moves. Moreover, our algorithm only needs one more boolean variable than the previous one, thus as in the Manne et al. algorithm, it only requires a constant amount of memory space (three identifiers and two booleans per node).",
keywords = "Distributed algorithm, Fault tolerance, Matching, Self-stabilization",
author = "Johanne Cohen and Khaled Ma{\^a}mra and George Manoussakis and Laurence Pilard",
note = "Publisher Copyright: {\textcopyright} Johanne Cohen, Khaled Ma{\^a}mra, George Manoussakis, and Laurence Pilard.; 20th International Conference on Principles of Distributed Systems, OPODIS 2016 ; Conference date: 13-12-2016 Through 16-12-2016",
year = "2017",
month = apr,
day = "1",
doi = "10.4230/LIPIcs.OPODIS.2016.11",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "11.1--11.17",
editor = "Ernesto Jimenez and Panagiota Fatourou and Fernando Pedone",
booktitle = "20th International Conference on Principles of Distributed Systems, OPODIS 2016",
address = "Germany",
}