Catalog 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.

Units: 3

Related Areas:

• Theory (THY)

Prerequisites: COMPSCI 170

Formats:
Spring: 3.0 hours of lecture and 1.0 hours of discussion per week
Fall: 3.0 hours of lecture and 1.0 hours of discussion per week

Grading Basis: letter

Final Exam Status: No final exam

---

Class homepage on inst.eecs

Links:

• CS enrollment policies
• EE enrollment policies
• HKN course maps