Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700): Difference between revisions
From MaRDI portal
Latest revision as of 11:50, 4 April 2025
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum bounded 3-dimensional matching is MAX SNP-complete |
scientific article |
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