Algorithms II

Dynamic programming, network flow, NP-completeness and approximation.

CMPUT-304 Year 3 3 credits 5 lessons planned

Offered by HSM University · Computing Science

Course content

  1. 1Dynamic programmingComing
  2. 2Network flowComing
  3. 3NP-completenessComing
  4. 4Approximation algorithmsComing
  5. 5Randomized algorithmsComing

Requirements

Recommended background. You can start any course at any time.

Description

Dynamic programming, network flow, NP-completeness and approximation.

Part of the Science stream, typically taken in year 3.