Understand why↗
The algorithm selects a set of disjoint edges M. The optimal cover must include at least one vertex per edge in M, so optimal cost >= |M|.
Conditions: The algorithm selects arbitrary edges and adds both endpoints until no edges remain
YouTubeApproximation Algorithms
5:48 – 6:31Watch this moment ↗
The algorithm selects a set of disjoint edges M. The optimal cover must include at least one vertex per edge in M, so optimal cost >= |M|.
Conditions: The algorithm selects arbitrary edges and adds both endpoints until no edges remain
YouTubeApproximation Algorithms
5:48 – 6:31Watch this moment ↗