Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
teaching:ss18:vl-randalgo [2018/07/05 09:24]
roeglin [Schedule]
teaching:ss18:vl-randalgo [2018/07/19 10:07]
roeglin [Notice]
Line 3: Line 3:
 ===== Notice ===== ===== Notice =====
  
-The first round of **oral exams** will take place on the 18th, 19th and 20th of July. The last date of the lecture will be the 12th of July.+The first round of **oral exams** will take place on the 18th, 19th and 20th of July.
  
-Please schedule the time of your exam with [[staff:​christianeandrade|Christiane Andrade]] in room 2.056.+The re-exams will be on 26th of September.
  
- <​color red> The last Tutorial will be held on July 17th as a chance to discuss questions. In order to help preparations,​ please send your questions to [[staff:clemensroesner|Clemens Rösner]] before July 16th.</​color>​+Please schedule the time of your exam with [[staff:christianeandrade|Christiane Andrade]] in room 2.056.
  
- <​color red> There will be no lecture on July 10. The last lecture will be on July 12.</​color>​ 
 ===== Lecture ===== ===== Lecture =====
  
Line 66: Line 65:
 |June 21| 7 Smoothed Complexity of Binary Optimization Problems| |June 21| 7 Smoothed Complexity of Binary Optimization Problems|
 |June 26| 7 (continued) Smoothed Complexity of Binary Optimization Problems| |June 26| 7 (continued) Smoothed Complexity of Binary Optimization Problems|
-|June 28| 8 Successive Shortest Path Algorithm|+|June 28| 8 Successive Shortest Path Algorithm\\ [[http://​roeglin.org/​teaching/​Skripte/​Slides_SSP.pdf|Slides]]|
 |July 3| 9 The 2-Opt Algorithm for the TSP\\ 9.1 Overview of Results\\ 9.2 Polynomial Bound for phi-Perturbed Graphs | |July 3| 9 The 2-Opt Algorithm for the TSP\\ 9.1 Overview of Results\\ 9.2 Polynomial Bound for phi-Perturbed Graphs |
 |July 5| 9.3 Improved Analysis | |July 5| 9.3 Improved Analysis |
 |July 10| no lecture | |July 10| no lecture |
-|July 12| 10 The k-Means Method |+|July 12| 10 The k-Means Method\\ [[http://​roeglin.org/​teaching/​Skripte/​Slides_kMeans.pdf|Slides]] ​|
 ===== Course Material ===== ===== Course Material =====
  

Page Tools