![NP-complete problems / Approximation algorithm / Vertex cover / Travelling salesman problem / Graph coloring / Metric k-center / Dynamic programming / Christofides algorithm / Set cover problem / Theoretical computer science / Mathematics / Computational complexity theory NP-complete problems / Approximation algorithm / Vertex cover / Travelling salesman problem / Graph coloring / Metric k-center / Dynamic programming / Christofides algorithm / Set cover problem / Theoretical computer science / Mathematics / Computational complexity theory](https://www.pdfsearch.io/img/a32d085b2c02eb1f1efdcf9863e4dc87.jpg) Date: 2014-12-28 09:03:25NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory | | Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772)Add to Reading ListSource URL: web.engr.illinois.eduDownload Document from Source Website File Size: 293,53 KBShare Document on Facebook
|