Course Websites

CS 573 - Algorithms

Last offered Fall 2014

Official Description

NP-completeness, design and analysis techniques, approximation algorithms, randomized algorithms, combinatorial optimization, linear programming. Intended for graduate students in Computer Science. Course Information: Same as CSE 515. Prerequisite: CS 373.

Related Faculty

TitleSectionCRNTypeHoursTimesDaysLocationInstructor
AlgorithmsONL58951ONL4 -    Sariel Har-Peled
AlgorithmsS35933LCD41230 - 1345 T R  0216 Siebel Center for Comp Sci Sariel Har-Peled