Basic Information
An Approach For Coping With The Apparent Intractability of Many Np-hard Problems Is to Look For The Best Approximate Solution, While Maintaining Polynomial Running Time. in This Course, The Basic Notions of Approximation Algorithms, Such As a Fully Polynomial Approximation Scheme, Are Reviewed. a Wide Variety Of Techniques For Approximating Problems in Combinatorial Optimization Are Discussed.
Faculty: Computer Science
|Undergraduate Studies
|Graduate Studies
Pre-required courses
(234247 - Algorithms 1 and 236343 - Theory of Computation)
Related Books
- Algorithm design / Jon Kleinberg, Eva Tardos. - Kleinberg, Jon
- Approximation algorithms / Vijay V. Vazirani. - Vazirani, Vijay V.
- Approximation algorithms / Vijay V. Vazirani. - Vazirani, Vijay V.,
- Graph theory / Reinhard Diestel. - Diestel, Reinhard
- Graph Theory [electronic resource] / by Reinhard Diestel. - Diestel, Reinhard.
- The design of approximation algorithms / David P. Williamson, David B. Shmoys. - Williamson, David P.
Semestrial Information
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Hadas Shachnai
Notes
-
לא תתקיים בחינה סופית.
Registration Groups
|
|
|
|
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Hadas Shachnai
Notes
-
לא תתקיים בחינה סופית.
Registration Groups
|
|
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Hadas Shachnai
Registration Groups
|
|