CS 6515 Graduate Algorithms

Not started

Georgia Tech OMSCS CS 6515

Graduate algorithm design and analysis with an emphasis on proofs.

Practice in the Flight Lab: Count the coins · Shortest path · Max flow · Point the reduction · Remainder of a power

Prerequisites

Undergraduate algorithms/data structures and discrete math.

Subareas

Dynamic programmingDivide & conquer, FFTGraph algorithms (DFS/SCC, shortest paths, MST)Max-flow / min-cutLinear programming & dualityNP-completeness & reductionsRSA / modular arithmetic

Main topics / syllabus areas

Dynamic programming
Divide & conquer, FFT
Graph algorithms (DFS/SCC, shortest paths, MST)
Max-flow / min-cut
Linear programming & duality
NP-completeness & reductions
RSA / modular arithmetic

Resources

OMSCS course page ↗omscs.gatech.edu
OMSCentral reviews ↗omscentral.com
Jeff Erickson, Algorithms (free book) ↗jeffe.cs.illinois.edu