CS 583
Fall 2013 All Classes
All Classes
Credit: 4 hours.
Approximation algorithms for NP-hard problems. Basic and advanced techniques in approximation algorithm design: combinatorial algorithms; mathematical programming methods including linear and semi-definite programming, local search methods, and others. Algorithms for graphs and networks, constraint satisfaction, packing and scheduling.
Prerequisite: CS 573 or consent of instructor.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
61241
|
Lecture
|
AA
|
11:00AM
-12:15PM
|
WF
|
1302 Siebel Center for Comp Sci
|
Chekuri, C
|
|