A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simpler linear time 23 - approximation for maximum weight matching |
scientific article; zbMATH DE number 5581182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching |
scientific article; zbMATH DE number 5581182 |
Statements
A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (English)
0 references
21 July 2009
0 references
matching
0 references
maximum weight matching
0 references
approximation
0 references
analysis of algorithms
0 references
0.9295095205307008
0 references
0.9085808396339417
0 references
0.9061934351921082
0 references
0.8999012112617493
0 references
