Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Last revision Both sides next revision
lehre:ss16:vl-randalg [2018/10/09 14:55]
schmidt [Schedule]
lehre:ss16:vl-randalg [2018/10/09 14:55]
schmidt [Schedule]
Line 26: Line 26:
 |  May 23|3.3.2 (contd) Routing in Hypercubes |\\ [MR95], pp. 77-79 | |  May 23|3.3.2 (contd) Routing in Hypercubes |\\ [MR95], pp. 77-79 |
 |  May 25|no lecture (Dies Academicus)| -- | |  May 25|no lecture (Dies Academicus)| -- |
-|  May 30|4 Random Walks\\ 4.1 Applications\\ 4.1.1 A local search algorithm for 2-SAT |{{:​lehre:​ss16:​vl-rapa:​ra_pa.pdf|Lecture Notes}}\\ [MU05], pp. 156-159\\ [MR95], pp. 128-129 |+|  May 30|4 Random Walks\\ 4.1 Applications\\ 4.1.1 A local search algorithm for 2-SAT |\\ [MU05], pp. 156-159\\ [MR95], pp. 128-129 |
 | June 01|4.1.2 Local Search algorithms for 3-SAT |\\ [MU05], pp.159-163\\ | | June 01|4.1.2 Local Search algorithms for 3-SAT |\\ [MU05], pp.159-163\\ |
-| June 06|6 Knapsack Problem and Multiobjective Optimization\\ 6.1 Nemhauser-Ullmann Algorithm| ​{{:​lehre:​ss16:​vl-rapa:​ra_pa.pdf|Lecture Notes}} ​|+| June 06|6 Knapsack Problem and Multiobjective Optimization\\ 6.1 Nemhauser-Ullmann Algorithm| ​ |
 | June 08|6.2 Number of Pareto-optimal Solutions\\ 6.2.1 Upper Bound |  | | June 08|6.2 Number of Pareto-optimal Solutions\\ 6.2.1 Upper Bound |  |
  

Page Tools