<p>Lecture, four hours; outside study, eight hours. Requisite: course 180. Background in discrete mathematics helpful. Theoretically sound techniques for dealing with NP-Hard problems. Inability to solve these problems efficiently means algorithmic techniques are based on approximation—finding solution that is near to best possible in efficient running time. Coverage of approximation techniques for number of different problems, with algorithm design techniques that include primal-dual method, linear program rounding, greedy algorithms, and local search. Letter grading.</p>

Computer Science

Known as the birthplace of the Internet and where countless other cutting-edge technologies took their first steps, the school is consistently ranked among the top 10 public engineering schools in the U.S.

Henry Samueli School of Engineering and Applied Science

Computer science is concerned with the design, modeling, analysis, and applications of computer systems.

General Catalog

Algorithms: Approximation Algorithms

COM SCI 280AP

4 units