Algorithms Seminar
Supervisor: Uri Zwick
March-June 2020
On-line meeting on Zoom:
https://zoom.us/j/617100880?pwd=NFh3ZGkwaDVsbmlaTEhNbmdHSzljdz09
Lectures will be based on the book:
David P. Williamson and David B. Shmoys
The Design of Approximation Algorithms
http://www.designofapproxalgs.com/download.php
Mailing list: http://listserv.tau.ac.il/archives/0368-3383-01.html
|
2 |
Mar
25 |
ערן
קירשנבאום |
Chapter 2:
Greedy algorithms and local search |
|
3 |
Apr |
נדב
בנימיני |
Chapter 3: Rounding data and
dynamic programming |
|
|
|
|
|
|
4 |
Apr
22 |
נופר
מרדכי |
Chapter 4: Deterministic rounding of linear programs |
|
|
|
|
|
|
5 |
May 6 |
גיא
שוורצברג |
Chapter 5: Random sampling and
randomized rounding
|
|
6 |
May 13 |
אור
ליכטר |
Chapter 7: The primal-dual
method |
|
7 |
May 20 |
שי
רהט |
Chapter 6: Randomized
rounding of semidefinite programs |
|
8 |
May
27 |
יאיר
וקנין |
Chapter 8: Cuts and metrics |
|
|
|
|
|
|
9 |
Jun 10 |
שי עיני |
Chapter 9: Further uses of greedy and local search algorithms |
|
10 |
Jun 17 |
איתי ונטורה |
Chapter 10: Further uses of rounding data and dynamic programming |
|
11 |
Jun 24 |
יובל שטיגר |
Chapter 11: Further uses of deterministic rounding of linear
programs |