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 Both sides next revision
teaching:ss18:vl-randalgo [2018/07/05 09:24]
roeglin [Schedule]
teaching:ss18:vl-randalgo [2018/07/09 09:08]
roeglin [Schedule]
Line 66: Line 66:
 |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