Example 1: Vertex Cover
Given G=(V,E), find a minimum sized subset W of the vertices V such that for every (v,w) in E, at least one of v or w is in W.
Approximation Algorithm:
- while edges remain
- select an arbitrary edge (u,v)
- add both u and v to the cover
- delete all edges incident on either u or v