๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A -integral relaxation for the A-matching problem

โœ Scribed by Robert Carr; Ojas Parekh

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
169 KB
Volume
34
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A matching problem in the plane
A matching problem in the plane
โœ Mikhail J. Atallah ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 428 KB
A survey of heuristics for the weighted
A survey of heuristics for the weighted matching problem
โœ David Avis ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 909 KB

This survey paper reviews results on heuristics for two weighted matching problems: matchings where the vertices are points in the plane and weights are Euclidean distances, and the assignment problem. Several heuristics are described in detail-and results are given for worst-case ratio bounds, abso

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 [