The following pages link to (Q2712300):
Displaying 8 items.
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Approximating the dense set-cover problem (Q1765297) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem (Q2182716) (← links)
- Approximating vertex cover on dense graphs (Q2921716) (← links)
- A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds (Q4640294) (← links)
- On hard instances of approximate vertex cover (Q4962765) (← links)
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds (Q5361909) (← links)