Pages that link to "Item:Q3088179"

The following pages link to Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179):

Displaying 2 items.

• Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
• Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (Q3453563) (← links)