The following pages link to (Q2921716):
Displayed 10 items.
- 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)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Approximating Subdense Instances of Covering Problems (Q2840726) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)