✦ 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
DOI: 10.1002/net.21516

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer programming formulations for the

Integer programming formulations for the minimum weighted maximal matching problem

✍ Z. Caner Taşkın, Tınaz Ekim 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 154 KB

Parallel Algorithms for Solving the Conv

Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem

✍ P. Beraldi; F. Guerriero; R. Musmanno 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 263 KB

A generalized Hungarian method for solvi

A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective

✍ Ulrich Derigs 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Decomposition algorithms for the maximum

Decomposition algorithms for the maximum-weight connected graph problem

✍ Heungsoon Felix Lee; Daniel R. Dooly 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

Exact and heuristic algorithms for solvi

Exact and heuristic algorithms for solving the generalized minimum filter placement problem

✍ E. Chisonge Mofya; J. Cole Smith 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 385 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 [