These problems will involve the material you have learned in this class: linear programming, integer programming, approximation algorithms and traveling salesperson problem. It will involve ...

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP ...