4

I found this pseudocode in a textbook but I do not properly understand it, and it was poorly explained.

Algorithm 8: Greedy Vertex Cover Algorithm Example(G=(V,E))
1) C := ;.
2) while (E 6= ;)
• Select a node v of maximal degree in G.
• C := C [{v}.
• Remove all edges e from E that are covered by v,
i.e. for which e\v 6= ; holds.
3) Return C.

The algorithm is a greedy algorithm to solve the Vertex Cover problem. Does anyone recognize it and know it's name? I would like to learn more about it.

Barney Chambers
  • 2,720
  • 6
  • 42
  • 78
  • I think it's just called the greedy algorithm for vertex cover. You'd be amazed how many algorithms like these have no standardized names. – templatetypedef May 02 '16 at 07:16

1 Answers1

2

I think you can find this particular algorithm on page 8 of this Vertex Cover Problem presentation provided by Gajanand Sharma.

It seems to be called Approx-Vertex-Cover also known as Vertex Cover Approximation Algorithm.

In the subsequent pages there is an example about the algorithm and how it works.

Also in Approximation Algorithms: Vertex Cover document at page 2 you can find another good explanation:

Algorithm 1: Approx-Vertex-Cover(G)

1 C←∅

2 while E 6= ∅

  pick any {u, v} ∈ E
  C ← C ∪ {u, v}
  delete all edges incident to either u or v

return C

Community
  • 1
  • 1
abarisone
  • 3,707
  • 11
  • 35
  • 54