Greedy Set Cover — Approximation

Repeatedly pick the set covering the most still-uncovered elements (ratio ≤ H(n) ≈ ln n + 1)

Instance

Run

Speed

Result

Universe n
5
Sets m
5
Covered
0
Sets chosen
0

Log

Coverage growth

covered max-gain set (chosen this round) gain (uncovered elements)

Universe

Sets (live gain = still-uncovered count)

Explanation

Load an instance and press Run all to watch greedy repeatedly pick the set covering the most still-uncovered elements until the whole universe is covered.