Algorithms Seminar
Supervisor:
Uri Zwick
First Semester 2017/2018
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
|
1 |
Oct
29 |
בן
סטרנסון |
Chapter 2:
Greedy algorithms and local search |
|
2 |
Nov |
בר אנג'ל |
Chapter 3: Rounding data and
dynamic programming |
|
3 |
Nov 12 |
מתן
גיזונטרמן |
Chapter 4: Deterministic rounding of linear programs |
|
4 |
Nov |
אלירן
כחלון |
Chapter 5: Random sampling and
randomized rounding
|
|
5 |
Nov |
עידו
אילני
|
Chapter 6: Randomized
rounding of semidefinite programs |
|
|
|
|
|
|
6 |
Dec |
אופיר
מוזס |
Chapter 7: The primal-dual
method |
|
7 |
Dec |
עוז ענני |
Chapter 8: Cuts and metrics |
|
8 |
Jan |
תמר סרדס |
Chapter 9: Further uses of greedy and local search algorithms |
|
9 |
Jan |
גל
וולפמן |
Chapter 10: Further uses of rounding data and dynamic programming |
|
10 |
Jan
|
גון
לוקוב |
Chapter 11: Further uses of deterministic rounding of linear
programs |
|
11 |
עדן ברק |
Chapter 12: Further uses of random sampling and |