Pages that link to "Item:Q5963655"
From MaRDI portal
The following pages link to An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655):
Displaying 15 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- On approximation of the vertex cover problem in hypergraphs (Q1779691) (← links)
- Approximation algorithm for the multicovering problem (Q2025081) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
- Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (Q3453563) (← links)
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (Q3587391) (← links)
- Approximation of Partial Capacitated Vertex Cover (Q5892615) (← links)
