{"paper":{"title":"Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George Manoussakis, Johanne Cohen, Khaled Ma\\^amra, Laurence Pilard","submitted_at":"2016-11-18T10:50:23Z","abstract_excerpt":"We present the first polynomial self-stabilizing algorithm for finding a $\\frac23$-approximation of a maximum matching in a general graph. The previous best known algorithm has been presented by Manne \\emph{et al.} \\cite{ManneMPT11} and has a sub-exponential time complexity under the distributed adversarial daemon \\cite{Coor}. Our new algorithm is an adaptation of the Manne \\emph{et al.} algorithm and works under the same daemon, but with a time complexity in $O(n^3)$ moves. Moreover, our algorithm only needs one more boolean variable than the previous one, thus as in the Manne \\emph{et al.} a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06038","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}