[prev] 79 [next]

Vertex Cover (cont)

An approximation algorithm for vertex cover:

approxVertexCover(G):
|  Input  undirected graph G=(V,E)
|  Output vertex cover of G
|
|  C=∅
|  unusedE=E
|  while unusedE≠∅ do
|  |  choose any (v,w)∈unusedE
|  |  C = C∪{v,w}
|  |  unusedE = unusedE\{all edges incident on v or w}
|  end while
|  return C