Pages that link to "Item:Q450531"
From MaRDI portal
The following pages link to Approximating vertex cover in dense hypergraphs (Q450531):
Displaying 13 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Approximating the dense set-cover problem (Q1765297) (← links)
- On approximation of the vertex cover problem in hypergraphs (Q1779691) (← links)
- Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs (Q2213812) (← links)
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- Approximating vertex cover on dense graphs (Q2921716) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- Approximate Set Covering in Uniform Hypergraphs (Q4366877) (← links)
- The Densest k-Subhypergraph Problem (Q4636436) (← links)
- An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
