Simultaneous matchings: Hardness and approximation (Q931730)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5293397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simultaneous matchings: Hardness and approximation |
scientific article; zbMATH DE number 5293397 |
Statements
Simultaneous matchings: Hardness and approximation (English)
0 references
26 June 2008
0 references
matchings
0 references
perfect matchings
0 references
constraint programming
0 references
NP-completeness
0 references
optimisation
0 references
hardness of approximation
0 references
bipartite graph
0 references
0.9760680198669434
0 references
0.7990854978561401
0 references
0.7910817265510559
0 references
0.7906126976013184
0 references
0.785394012928009
0 references
