A simple approximation algorithm for the weighted matching problem (Q1007528): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computing Minimum-Weight Perfect Matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138921 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster scaling algorithms for general graph matching problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity and modeling aspects of mesh refinement into quadrilaterals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quality matching and local improvement for multilevel graph-partitioning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4251057 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank | |||
Normal rank |
Revision as of 04:46, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple approximation algorithm for the weighted matching problem |
scientific article |
Statements
A simple approximation algorithm for the weighted matching problem (English)
0 references
23 March 2009
0 references
approximation algorithms
0 references
analysis of algorithms
0 references
graph algorithms
0 references
maximum weight matching
0 references