Differences

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

Link to this comparison view

Both sides previous revision Previous revision
teaching:ss20:vl-randalgo [2020/06/29 10:53]
ipsarros [Problem Sets]
teaching:ss20:vl-randalgo [2020/10/15 23:36] (current)
roeglin [Schedule]
Line 53: Line 53:
 |May 28| 4.1 Stirling's formula and the Binomial Theorem\\ 4.2.1 A Local Search Algorithm for 2-SAT| |May 28| 4.1 Stirling's formula and the Binomial Theorem\\ 4.2.1 A Local Search Algorithm for 2-SAT|
 |June 2| 4.2.2 A Local Search Algorithm for 3-SAT| |June 2| 4.2.2 A Local Search Algorithm for 3-SAT|
 +|June 4| 6 Knapsack Problem and Multiobjective Optimization\\ 6.1 Nemhauser-Ullmann Algorithm|
 +|June 9| 6.2 Number of Pareto-optimal Solutions|
 +|June 11| 6.2 Number of Pareto-optimal Solutions|
 +|June 16| 6.2 Number of Pareto-optimal Solutions|
 +|June 18| 6.3 Multiobjective Optimization\\ 6.4 Core Algorithms|
 +|June 23| 7 Smoothed Complexity of Binary Optimization Problems|
 +|June 25| 7 Smoothed Complexity of Binary Optimization Problems|
 +|June 30| 9 The 2-Opt Algorithm for the TSP\\ 9.1 Overview of Results\\ 9.2 Polynomial Bound for phi-Perturbed Graphs |
 +|July 2| 9.3 Improved Analysis  |
 +|July 7| 10 The k-Means Method  |
 ===== Course Material ===== ===== Course Material =====
  

Page Tools