CS 270. Combinatorial Algorithms and Data Structures

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

Prerequisites: 170.

Formats:
Fall: 3 hours of lecture and 1 hour of discussion per week
Spring: 3 hours of lecture and 1 hour of discussion per week

Grading basis: letter

Final exam status: No final exam


Class Schedule (Spring 2019):
TuTh 5:00PM - 6:29PM, Valley Life Sciences 2040 – Satish Rao

Class homepage on inst.eecs

General Catalog listing

Related Areas: