A simple approximation algorithm for the weighted matching problem
type: Item
instance of: scholarly article
title: A simple approximation algorithm for the weighted matching problem
zbMATH Open document ID: 1173.68861
DOI: 10.1016/S0020-0190(02)00393-9
author: Doratha E. Drake
author: Stefan Hougardy
published in: Information Processing Letters
publication date: 2009-03-23T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5530879
zbMATH Keywords: approximation algorithms
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: maximum weight matching
describes a project that uses: Blossom IV
MaRDI profile type: Publication
cites work: Computing Minimum-Weight Perfect Matchings
cites work: Q3138921
cites work: Faster scaling algorithms for general graph matching problems
cites work: Complexity and modeling aspects of mesh refinement into quadrilaterals
cites work: Quality matching and local improvement for multilevel graph-partitioning
cites work: Q4251057
cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
full work available at URL: s0020-0190(02)00393-9
OpenAlex ID: W2024607148
description: scientific article; zbMATH DE number 5530879