Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700)
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 4170090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum bounded 3-dimensional matching is MAX SNP-complete |
scientific article; zbMATH DE number 4170090 |
Statements
Maximum bounded 3-dimensional matching is MAX SNP-complete (English)
0 references
1991
0 references
approximation
0 references
combinatorial problems
0 references
computational complexity
0 references
MAX SNP- complete problems
0 references
0.9182398
0 references
0.8146555
0 references
0.8110938
0 references
0.8089033
0 references
0.8052131
0 references
0 references
0 references
