Pages that link to "Item:Q3579212"
From MaRDI portal
The following pages link to Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε (Q3579212):
Displaying 10 items.
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Disjoint bases in a polymatroid (Q3055784) (← links)
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
