A list heuristic for vertex cover

Authors:
David Avis;Tomokazu Imamura
Affiliations:
School of Computer Science, McGill University, 3480 University, Montreal, Que., Canada H3A 2A7;Graduate School of Informatics, Kyoto University, Japan
Venue:
Operations Research Letters
Year:
2007

Citing 2
Cited 4

Approximation algorithms

Approximation algorithms
Introduction to algorithms

Introduction to algorithms

A better list heuristic for vertex cover

Information Processing Letters
Mean analysis of an online algorithm for the vertex cover problem

Information Processing Letters
Priority algorithms for graph optimization problems

Theoretical Computer Science
Analytical and experimental comparison of six algorithms for the vertex cover problem

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze a list heuristic for the vertex cover problem that handles the vertices in a given static order based on the degree sequence. We prove an approximation ratio of at most @D/2+32 for a nonincreasing degree sequence, and show that no ordering can achieve an approximation ratio of less than @D/2.