Pages that link to "Item:Q2768313"
From MaRDI portal
The following pages link to Approximating coloring and maximum independent sets in 3-uniform hypergraphs (Q2768313):
Displaying 6 items.
- Wireless capacity with arbitrary gain matrix (Q742412) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs (Q2765960) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609) (← links)