Discussion 6: Greedy Coloring and Matching

Content locked

The catalog is public. Reading this content requires approved access.

Problem 1: Greedy graph coloring

Problem 2: Greedy matching: at least half the optimum

(a) Feasibility and maximality

(b) Approximation guarantee