𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalized hypergreedy algorithm for weighted perfect matching

✍ Scribed by Celina Imielinska; Bahman Kalantari

Publisher
Springer Netherlands
Year
1993
Tongue
English
Weight
699 KB
Volume
33
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 [