✦ LIBER ✦

Approximation algorithms for weighted matching

✍ Scribed by Shankar M. Venkatesan

Book ID: 107948576
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 643 KB
Volume: 54
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90022-3

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 [

Linear-time approximation algorithms for

Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane

✍ Masao Iri; Kazuo Murota; Shouichi Matsui 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Weighted median algorithms for L1approxi

Weighted median algorithms for L1approximation

✍ Chaya Gurwitz 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 579 KB

Parameterized algorithms for weighted ma

Parameterized algorithms for weighted matching and packing problems

✍ Jianxin Wang; Yunlong Liu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Algorithms for approximate string matchi

Algorithms for approximate string matching

✍ Esko Ukkonen 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 867 KB

Faster approximation algorithms for weig

Faster approximation algorithms for weighted triconnectivity augmentation problems

✍ Zeev Nutov; Michal Penn 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 81 KB