The following pages link to Computing and Combinatorics (Q4681170):
Displaying 5 items.
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Maintaining a large matching and a small vertex cover (Q2875173) (← links)
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
- Approximating V<scp>ertex</scp> C<scp>over</scp> using Structural Rounding (Q5147498) (← links)