| Approx Algorithms In Action - 22802 - CS 59000 - AAA |
||||
|---|---|---|---|---|
|
Associated Term: Spring 2021
Levels: Graduate, Professional, Undergraduate West Lafayette Campus Lecture Schedule Type Learning Outcomes: The design of approximation algorithms for several problems on graphs such as matching and edge cover, and their applications. Combinatorial structures such as matroids, extendible systems, submodular functions, primal-dual linear programming framework, etc. Implementation of these algorithms . Applications of matchings and edge covers. Required Materials: Papers from the research literature. Technical Requirements: Students should have a graduate level course on Algorithms. Programming skills to implement algorithms using a language of your choice. View Catalog Entry
| ||||
