What would you like to understand?

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

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

FPTAS and PTAS allow arbitrarily close approximation. APX allows constant-factor approximation.

Conditions: Comparing standard approximation classes for optimization problems.

FPTAS and PTAS allow arbitrarily close approximation. APX allows constant-factor approximation.

Conditions: Comparing standard approximation classes for optimization problems.