Sign up for our weekly newsletter!
Department:
Course Number:
270
CCN:
26904
Instructor:
Rao
Units:
3
Description:
Design and analysis of efficient algorithms for combinatorial problems. Network flow theory, matching theory, matroid theory; augmenting-path algorithms; branch-and-bound algorithms; data structure techniques for efficient implementation of combinatorial algorithms; analysis of data structures; applications of data structure techniques to sorting, searching, and geometric problems.
Semester:
Spring 2013
Term (SP for Spring; FL for Fall):
SP