Pages that link to "Item:Q3453563"
From MaRDI portal
The following pages link to Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (Q3453563):
Displaying 5 items.
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (Q3587391) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5918419) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
