On the complexity of approximating \(k\)-dimensional matching (Q5900924)
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 5712655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of approximating \(k\)-dimensional matching |
scientific article; zbMATH DE number 5712655 |
Statements
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (English)
0 references
26 May 2010
0 references
0.8892213702201843
0 references
0.830674946308136
0 references
0.830017626285553
0 references
0.8169639110565186
0 references
0.8165597915649414
0 references
