The following pages link to (Q3322143):
Displaying 13 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- Vertex cover: Further observations and further improvements (Q2775891) (← links)
- Combining Two Worlds: Parameterised Approximation for Vertex Cover (Q3060750) (← links)
- (Q3641922) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Approximating V<scp>ertex</scp> C<scp>over</scp> using Structural Rounding (Q5147498) (← links)
- Parameterized Reductions and Algorithms for Another Vertex Cover Generalization (Q5199249) (← links)
- Approximation of Self-stabilizing Vertex Cover Less Than 2 (Q5307040) (← links)
