A list heuristic for vertex cover (Q2643795): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.orl.2006.03.014 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2095553101 / rank | |||
Normal rank |
Revision as of 21:09, 19 March 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