CS 583

Fall 2021 All Classes

All Classes

Approximation Algorithms

SHOW FINAL EXAM SCHEDULE

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.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 583 class schedule data for fall 2021
	CRN	Type	Section	Time	Day	Location	Instructor	Section Details
	61241	Lecture	AA	12:30PM -1:45PM	TR	Siebel Center for Comp Sci	Chekuri, C	Part of Term: 1 Date Range: 08/23/21-12/08/21 Credit: 4 hours Section Info: 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. For up-to-date information about CS course restrictions, please see the following link: http://go.cs.illinois.edu/csregister Restriction(s): Restricted to Graduate - Urbana-Champaign. Not intended for MCS:Computer Sci Online -UIUC, MCS:Computer Sci Online -UIUC, or NDEG:Computer Science Onl-UIUC. Not intended for First Time Freshman students.