𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition algorithms for solving the minimum weight maximal matching problem

✍ Scribed by Bodur, Merve; Ekim, Tinaz; Taşkin, Z. Caner


Book ID
121834732
Publisher
John Wiley and Sons
Year
2013
Tongue
English
Weight
166 KB
Volume
62
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A simple approximation algorithm for the
✍ 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 [