A self-stabilizing 2/3-approximation algorithm for the maximum matching problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2011

A self-stabilizing 2/3-approximation algorithm for the maximum matching problem

Fredrik Manne
  • Fonction : Auteur
Morten Mjelde
  • Fonction : Auteur
Laurence Pilard
Sébastien Tixeuil

Résumé

The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and self-stabilizing literature. Previous work has resulted in self-stabilizing algorithms for computing a maximal ($\frac{1}{2}$-approximation) matching in a general graph, as well as computing a $\frac{2}{3}$-approximation on more specific graph types. In the following we present the first self-stabilizing algorithm for finding a $\frac{2}{3}$-approximation to the maximum matching problem in a general graph. We show that our new algorithm when run under the distributed adversarial daemon, stabilizes after at most $O(n^2)$ rounds. However, it might still use an exponential number of time steps.

Dates et versions

hal-01154122 , version 1 (21-05-2015)

Identifiants

Citer

Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil. A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. Theoretical Computer Science, 2011, 412 (40), pp.5515-5526. ⟨10.1016/j.tcs.2011.05.019⟩. ⟨hal-01154122⟩
65 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More