Pages that link to "Item:Q4962765"
From MaRDI portal
The following pages link to On hard instances of approximate vertex cover (Q4962765):
Displaying 6 items.
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Vertex Cover Gets Faster and Harder on Low Degree Graphs (Q2920457) (← links)
- Approximating vertex cover on dense graphs (Q2921716) (← links)
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)