A list heuristic for vertex cover.pdfVIP

A List Heuristic for Vertex Cover David Avis School of Computer Science, McGill University ∗ Tomokazu Imamura Graduate School of Informatics, Kyoto University Abstract We analyze a list heuristic for the vertex cover problem that han- dles the vertices in a given static order based on the degree sequence. We prove an approximation ratio of at most √∆/2 + 3/2 for a non- increasing degree sequence,