Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability (Q5943819)
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 1648631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability |
scientific article; zbMATH DE number 1648631 |
Statements
Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability (English)
0 references
19 September 2001
0 references
approximation algorithms
0 references
hypergraph 2-colorability
0 references
set splitting
0 references
MAXNAESP
0 references
MAX-CUT
0 references
0.7935709357261658
0 references
0.7618893980979919
0 references
0.7568989396095276
0 references
0.7553543448448181
0 references
