✦ LIBER ✦

A randomized algorithm for the on-line weighted bipartite matching problem

✍ Scribed by Béla Csaba; András Pluhár

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 283 KB
Volume: 11
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-007-0037-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line algorithms for weighted bipartit

On-line algorithms for weighted bipartite matching and stable marriages

✍ Samir Khuller; Stephen G. Mitchell; Vijay V. Vazirani 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 884 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 [

An O(n log n) algorithm for the convex b

An O(n log n) algorithm for the convex bipartite matching problem

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Bipartite graph matching for points on a

Bipartite graph matching for points on a line or a circle

✍ Michael Werman; Shmuel Peleg; Robert Melter; T.Y Kong 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 376 KB

A randomized parallel algorithm for stri

A randomized parallel algorithm for string matching on hypercube

✍ Kuo-Liang Chung 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Finding a complete matching with the max

Finding a complete matching with the maximum product on weighted bipartite graphs

✍ Frank S.C. Tseng; Wei-Pang Yang; Arbee L.P. Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 352 KB