Pages that link to "Item:Q2921716"
From MaRDI portal
The following pages link to Approximating vertex cover on dense graphs (Q2921716):
Displaying 18 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
- Approximating the dense set-cover problem (Q1765297) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Approximating subdense instances of covering problems (Q2840726) (← links)
- Vertex Cover Gets Faster and Harder on Low Degree Graphs (Q2920457) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- Computing and Combinatorics (Q4681170) (← links)
- On hard instances of approximate vertex cover (Q4962765) (← links)
- Approximating V<scp>ertex</scp> C<scp>over</scp> using Structural Rounding (Q5147498) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)