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.
Can we do better?<br />
Actually, NO!<br />
It has been shown that for any c > 0, if there is an approximation<br />
algorithm for set <strong>cover</strong> with guarantee at most (1 − c) ln n, then<br />
(well, not actually P=NP, but something just as unlikely: every<br />
<strong>problem</strong> in NP could then be solved in time O(n polylog(n) ), which is<br />
not thought to be possible. . . )
Change language