CSCI2510
(Formerly
CS251
)
Approximation Algorithms
- Instructor(s):
-
- Course Home Page:
-
| Location: |
CIT506 |
| Meeting Time: |
M,W 2-3:20 |
| Exam Group: |
07 |
| Semester: |
1 |
| Offered This Year? |
Yes
|
| When Offered? |
Every Year
|
Description
Approximation algorithms deal with NP-hard combinatorial optimization problems by efficiently constructing a suboptimal solution with some specified quality guarantees. We study techniques such as linear programming and semidefinite programming relaxations, and apply them to problems such as facility location, scheduling, bin packing, maximum satifiability or vertex cover. Prerequisite: CSCI1490 or CSCI1570.
|
Page Owner: webmaster
|
Last Modified: Tue Sep 9 13:17:33 2008
|
