Set cover problem: definition - Organic Origami
Set cover problem: definition - Organic Origami
Set cover problem: definition - Organic Origami
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Greedy set <strong>cover</strong> analysis (2)<br />
Theorem<br />
Greedy is an H n approximation algorithm for set <strong>cover</strong><br />
(H n = 1 + 1/2 + · · · + 1/n).<br />
Proof.<br />
The cost of each chosen set is the sum of its elements’ prices. The<br />
total cost of the set <strong>cover</strong> is<br />
n∑<br />
price(e k ) ≤ OPT (1 + 1 2 + 1 3 + · · · + 1 n ).<br />
k=1
Change language