Algorithms column: the vertex cover problem

Authors:
Samir Khuller
Affiliations:
University of Maryland, College Park, MD
Venue:
ACM SIGACT News
Year:
2002

Citing 4
Cited 5

Ramsey numbers and an approximation algorithm for the vertex cover problem

Acta Informatica
A primal-dual parallel approximation technique applied to weighted set and vertex covers

Journal of Algorithms
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Lecture notes on approximation algorithms: Volume I

Lecture notes on approximation algorithms: Volume I

Polynomial-time data reduction for dominating set

Journal of the ACM (JACM)
Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract