The following pages link to (Q4828988):
Displaying 3 items.
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508) (← links)
- Improved bounds and algorithms for hypergraph 2-coloring (Q4943351) (← links)