![Page 1: CS 466 Fall 2019 Lecture 13 - Approximation Algorithms ... › ~cs466 › Lectures › Lecture13.pdf · CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna Lubiw Univ. Waterloo](https://reader033.vdocuments.net/reader033/viewer/2022060500/5f1aca3a386f56011d4f8421/html5/thumbnails/1.jpg)
- 159 -
CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna LubiwUniv. Waterloo
![Page 2: CS 466 Fall 2019 Lecture 13 - Approximation Algorithms ... › ~cs466 › Lectures › Lecture13.pdf · CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna Lubiw Univ. Waterloo](https://reader033.vdocuments.net/reader033/viewer/2022060500/5f1aca3a386f56011d4f8421/html5/thumbnails/2.jpg)
- 160 -
CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna LubiwUniv. Waterloo
![Page 3: CS 466 Fall 2019 Lecture 13 - Approximation Algorithms ... › ~cs466 › Lectures › Lecture13.pdf · CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna Lubiw Univ. Waterloo](https://reader033.vdocuments.net/reader033/viewer/2022060500/5f1aca3a386f56011d4f8421/html5/thumbnails/3.jpg)
- 161 -
CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna LubiwUniv. Waterloo
![Page 4: CS 466 Fall 2019 Lecture 13 - Approximation Algorithms ... › ~cs466 › Lectures › Lecture13.pdf · CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna Lubiw Univ. Waterloo](https://reader033.vdocuments.net/reader033/viewer/2022060500/5f1aca3a386f56011d4f8421/html5/thumbnails/4.jpg)
- 162 -
CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna LubiwUniv. Waterloo
![Page 5: CS 466 Fall 2019 Lecture 13 - Approximation Algorithms ... › ~cs466 › Lectures › Lecture13.pdf · CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna Lubiw Univ. Waterloo](https://reader033.vdocuments.net/reader033/viewer/2022060500/5f1aca3a386f56011d4f8421/html5/thumbnails/5.jpg)
- 163 -
CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna LubiwUniv. Waterloo
![Page 6: CS 466 Fall 2019 Lecture 13 - Approximation Algorithms ... › ~cs466 › Lectures › Lecture13.pdf · CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna Lubiw Univ. Waterloo](https://reader033.vdocuments.net/reader033/viewer/2022060500/5f1aca3a386f56011d4f8421/html5/thumbnails/6.jpg)
- 164 -
CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna LubiwUniv. Waterloo
![Page 7: CS 466 Fall 2019 Lecture 13 - Approximation Algorithms ... › ~cs466 › Lectures › Lecture13.pdf · CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna Lubiw Univ. Waterloo](https://reader033.vdocuments.net/reader033/viewer/2022060500/5f1aca3a386f56011d4f8421/html5/thumbnails/7.jpg)
- 165 -
Suppose that the optimum cover has k sets. Then at a stage where r items remain to be covered, some set covers r/k of them. Therefore, choosing the set that covers the most new points reduces the number of uncovered points to r − r/k = r(1 − 1/k). If we start with n points and repeat this process n times, r ≤ n(1 − 1/k)j . Since r is an integer, we are done when n(1 − 1/k)j < 1. This happens when j = O(k log n). Hence, α = j/k = O(log n).
CS 466 Fall 2019 Lecture 13 - Approximation Algorithms Anna LubiwUniv. Waterloo