Top | recent changes | Preferences

VERTEX-COVER: Given an undirected graph G=(V,E), find a minimum-size set of vertices such that every edge has some vertex in the set.

2-approximation algorithm for vertex cover

  1. Find a maximal matching and output the set of matched vertices

thm 1.3 in text: The above algorithm is a 2-approximation algorithm for vertex cover.


Top | recent changes | Preferences
This page is read-only | View other revisions
Last edited January 24, 2004 3:06 pm by NealYoung (diff)