✦ LIBER ✦

A self-stabilizing -approximation algorithm for the maximum matching problem

✍ Scribed by Fredrik Manne; Morten Mjelde; Laurence Pilard; Sébastien Tixeuil

Book ID: 113927410
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 280 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.05.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A self-stabilizing algorithm for the max

A self-stabilizing algorithm for the maximum flow problem

✍ Sukumar Ghosh; Arobinda Gupta; Sriram V. Pemmaraju 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 609 KB

A new analysis of a self-stabilizing max

A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2

✍ Volker Turau; Bernd Hauck 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 349 KB

A self-stabilizing algorithm for maximal

A self-stabilizing algorithm for maximal matching

✍ Su-Chu Hsu; Shing-Tsaan Huang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Distributed algorithm for approximating

Distributed algorithm for approximating the maximum matching

✍ A. Czygrinow; M. Hańćkowiak; E. Szymańska 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 299 KB

A simple approximation algorithm for the

A simple approximation algorithm for the weighted matching problem

✍ Doratha E Drake; Stefan Hougardy 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 61 KB

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [

A Self-stabilizing Algorithm for the Med

A Self-stabilizing Algorithm for the Median Problem in

✍ Victor Chepoi; Tristan Fevat; Emmanuel Godard; Yann Vaxès 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 759 KB