COMP.7100 — Graduate

Id: 036940 Offering: 1 Credits: 3-3

Description

This course covers advanced topics in approximation algorithms for NP-hard problems, including combinatorial algorithms and LP-based algorithms for set cover, k-cut, k-center, feedback vertex set, shortest superstring, knapsack, bin packing, maximum satisfiability, scheduling, Steiner tree, Steiner Forest, Steiner network, facility location, k-median, semidefinite programming. It also covers counting problems, shortest vector, hardness of approximation, and open problems for research.

Prerequisites

Pre-Req: 91.503 Algorithms.

View Current Offerings

COMP.7100 — Online and Continuing Education

Id: 036940 Offering: 2 Credits: 3-3

Description

This course covers advanced topics in approximation algorithms for NP-hard problems, including combinatorial algorithms and LP-based algorithms for set cover, k-cut, k-center, feedback vertex set, shortest superstring, knapsack, bin packing, maximum satisfiability, scheduling, Steiner tree, Steiner Forest, Steiner network, facility location, k-median, semidefinite programming. It also covers counting problems, shortest vector, hardness of approximation, and open problems for research.

Prerequisites

Students with a CSCE or UGRD career need permission to take Graduate Level Courses.

View Current Offerings