Pages that link to "Item:Q4820902"
From MaRDI portal
The following pages link to Approximate coloring of uniform hypergraphs (Q4820902):
Displaying 9 items.
- Extended box clustering for classification problems (Q724605) (← links)
- Edge-coloring of 3-uniform hypergraphs (Q729801) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- The hardness of 3-uniform hypergraph coloring (Q2368586) (← links)
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs (Q2768313) (← links)
- (Q3060863) (← links)
- Approximations to <i>m</i>‐Colored Complete Infinite Hypergraphs (Q3466346) (← links)
- Approximating Independent Set and Coloring in Random Uniform Hypergraphs (Q3599156) (← links)