A list heuristic for vertex cover (Q2643795): Difference between revisions

A class of approximation algorithms for the minimum vertex cover problem for graphs is studied. These algorithms, called list heuristics, handle the vertices in a given static order based on the degree sequence. The authors prove an approximation ratio of at most \(\sqrt{\Delta}/2+\frac{3}{2}\) for a nonincreasing degree sequence, and show that no ordering can guarantee an approximation ratio of less than \(\sqrt{\Delta}/2\), where \(\Delta\) is the maximum degree.