everything.study
CSI 4105

Design and Analysis of Algorithms II

3 units

Winter 2017

Topics

  • NP-completeness
  • Reductions for NP-completeness proofs
  • Approximation algorithms
  • Local search
  • Backtracking
  • Randomized algorithms
  • Polynomial-time special cases
  • Complexity classes beyond NP

Readings

  • Algorithm Design
    Kleinberg; Tardos · Not specified · Required
  • Class notes distributed by email or course website.
Sources