Efficient algorithms for variants of weighted matching and assignment problems (Q942999)
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: Efficient algorithms for variants of weighted matching and assignment problems |
scientific article; zbMATH DE number 5322607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for variants of weighted matching and assignment problems |
scientific article; zbMATH DE number 5322607 |
Statements
Efficient algorithms for variants of weighted matching and assignment problems (English)
0 references
8 September 2008
0 references
maximum weight maximum cardinality matching
0 references
approximation algorithm
0 references
graph algorithm
0 references
reduction
0 references
0.8358814120292664
0 references
0.8249680399894714
0 references
0.8228364586830139
0 references
0.8198184370994568
0 references
