Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformatica:alg2:algo2_16:start [14/12/2016 alle 16:06 (9 anni fa)] – Roberto Grossi
+++ magistraleinformatica:alg2:algo2_16:start [14/01/2017 alle 23:07 (9 anni fa)] (versione attuale) – [Announcements] Roberto Grossi
@@ Linea 4: / Linea 4: @@
 ==== Announcements ====
-  * Question time: Fri. Dec. 16, 2016, at 9:00-13:00 in room N1 (aula N1).
+  * Exams -- written part: [[.results_2016:|results here]].
-  * Final test (verifica) on Dec. 20, 2016, at 11:00-13:00 in room C1 (aula C1), please register.
   * The {{:magistraleinformatica:alg2:algo2_16:esercitazioni2016.pdf|final list}} of problems discussed in class is available.
-  * Office hours: Thu. 14-18 (in my room at the Dipartimento di Informatica)
+  * First meeting for oral exam calendar: Jan. 16, 2016 at 9:00 in office (room 342 DN).
+  * Second meeting for oral exam calendar: Feb. 13, 2016 at 9:00 in office (room 342 DN).
+  * Office hours: Thu. 14-18 (in my room at the Dipartimento di Informatica) or by appointment.
 ==== Overview ====
@@ Linea 21: / Linea 22: @@
 Please note that several topics are the outcome of recent advancement in algorithms and data structures, and thus most of the course material consists in research papers or book chapters.
-^ Date ^ Topics ^ References and notes ^
-| Sept. 21| Introduction to the course. Entrance exam. | - |
 === Warming up ===
@@ Linea 32: / Linea 30: @@
 ^ Date ^ Topics ^ References and notes ^
+| Sept. 21| Introduction to the course. Entrance exam. | - |
 | Sept. 22| Graphs representations. BFS. Dijkstra algorithm for SSSP. Problem "hogwarts".| [CLRS 22.1, 22.2, 24.3] {{:magistraleinformatica:alg2:algo2_16:hogwarts.pdf|hogwarts}} |
 | Sept. 27| Problem solving: "hogwarts".| {{:magistraleinformatica:alg2:algo2_16:hogwarts.pdf|hogwarts}} |
@@ Linea 86: / Linea 85: @@
 | Dec. 13 | 2-approximation for min-vertex cover and max cut. | [CLRS 35.1] {{:magistraleinformatica:alg2:algo2_14:lec02.pdf|Notes}} |
 | Dec. 14 | Problem solving: greedy strategy for min vertex cover and weighted max cut. | {{:magistraleinformatica:alg2:algo2_16:esercitazioni2016.pdf|Problems 20 and 21}} |
-| Dec. 15 | Approximation algorithms for knapsack and bin-packing problems. | [[http://www.dis.uniroma1.it/~ausiello/InfoTeoIIRM/book/chapter02.pdf| chapt.2: par. 2.1.1, 2.2.2]]|
+| Dec. 15 | Approximation algorithms for bin-packing and knapsack problems. | [[http://www.dis.uniroma1.it/~ausiello/InfoTeoIIRM/book/chapter02.pdf| chapt.2: par. 2.1.1, 2.2.2]]|
 | Dec. 16 | Question time | - |