<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2016-02-26 12:53:21Mathematics Computational complexity theory Graph theory NP-complete problems Operations research Travelling salesman problem Theoretical computer science Approximation algorithm Steiner tree problem Greedy algorithm Optimization problem Set cover problem |
Add to Reading List |
CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.
