A list heuristic for vertex cover (Q2643795): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:43, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A list heuristic for vertex cover |
scientific article |
Statements
A list heuristic for vertex cover (English)
0 references
27 August 2007
0 references
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.
0 references
vertex cover
0 references
approximation algorithm
0 references
list heuristic
0 references