Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability (Q4511216)
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 1522920
| 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 1522920 |
Statements
13 February 2001
0 references
approximation algorithms
0 references
hypergraph 2-colorability
0 references
set splitting
0 references
0.8886895775794983
0 references
0.8886895775794983
0 references
0.7816644310951233
0 references
0.7743921875953674
0 references
Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability (English)
0 references
Hypergraph 2-colorability, also known as set splitting, is a widely studied problem in graph theory. The authors recast the maximization version of it as a special type of satisfiability problem and give approximation algorithms for it. For the entire collection see [Zbl 0933.00045].
0 references
