Pages that link to "Item:Q3587391"
From MaRDI portal
The following pages link to On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (Q3587391):
Displaying 6 items.
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Hypergraph representation via axis-aligned point-subspace cover (Q2154113) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- Approximation algorithms for orthogonal line centers (Q6166042) (← links)
