Strumenti Utente

Strumenti Sito


magistraleinformaticanetworking:ae:ae2014:start

Differenze

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

Link a questa pagina di confronto

Entrambe le parti precedenti la revisioneRevisione precedente
Prossima revisione
Revisione precedente
magistraleinformaticanetworking:ae:ae2014:start [22/05/2015 alle 09:57 (9 anni fa)] – [Lectures] Paolo Ferraginamagistraleinformaticanetworking:ae:ae2014:start [01/02/2016 alle 08:56 (9 anni fa)] (versione attuale) – [Exam] Paolo Ferragina
Linea 33: Linea 33:
  
 ^ Dates ^ Room ^ Testo ^ ^ Dates ^ Room ^ Testo ^
-| 05-06-2015 | room L1, hr **** text +| 05-06-2015 | L1 | no participants 
-| 29-06-2015 | room L1, hr 9:00 | text | +| 29-06-2015 | L1 | {{:magistraleinformaticanetworking:ae:ae2014:ae150629.doc|text}} 
-| 20-07-2015 | room L1, hr 9:00 | text |+| 20-07-2015 | L1 | {{:magistraleinformaticanetworking:ae:ae2014:ae150720.doc|text}} | 
 +| 10-09-2015 | L1 | {{:magistraleinformaticanetworking:ae:ae2014:ae150910.doc|text}} | 
 +| 11-01-2016 | L1 | {{:magistraleinformaticanetworking:ae:ae2014:ae160111.doc|text}} | 
 +| 01-02-2016 | L1 | {{:magistraleinformaticanetworking:ae:ae2014:ae160201.doc|text}} |
  
  
Linea 91: Linea 94:
 | 18/05/2015 | Minimum Spanning Tree problem: definition, Greedy approach, Kruskal's and Prim's algorithms.  | {{:magistraleinformaticanetworking:ae:ae2013:mst-clr.pdf|Chap 23 of CLR}}  | | 18/05/2015 | Minimum Spanning Tree problem: definition, Greedy approach, Kruskal's and Prim's algorithms.  | {{:magistraleinformaticanetworking:ae:ae2013:mst-clr.pdf|Chap 23 of CLR}}  |
 | 19/05/2015 | Algorithms for external and semi-external computation of MST. Also use of MST for clustering and for the bottleneck shortest path problem (no proof). | A part of the {{:magistraleinformaticanetworking:ae:ae2014:mst-mehlhorn.pdf|Mehlhorn-Sander's book}}, look at Sect 11.5. | | 19/05/2015 | Algorithms for external and semi-external computation of MST. Also use of MST for clustering and for the bottleneck shortest path problem (no proof). | A part of the {{:magistraleinformaticanetworking:ae:ae2014:mst-mehlhorn.pdf|Mehlhorn-Sander's book}}, look at Sect 11.5. |
-| 25/05/2015 | Room N1, hr 11-13 |  | +| 25/05/2015 | Shortest Path problem: Dijkstra's algorithm. Steiner Tree problem: definition and a 2-approximate solutionTraveling Salesman Tour problemdefinition and a 2-approximate solution. | Part of the {{:magistraleinformaticanetworking:ae:ae2013:clr_-_sp.pdf|chap on Shortest Path of CLR}}. Also {{:magistraleinformaticanetworking:ae:ae2012:mst-mehlhorn.pdf|sect 11.5 and 11.6}} of Sanders-Mehlhorn's book. | 
-| 26/05/2015 | Room C, hr 11-13 |  | +| 26/05/2015 | Exercises on Graph Problems |  |
-===== Topics to be dealt with, probably ===== +
- +
- +
-|  | Shortest Path problem: Dijkstra's algorithm. Some considerations on external and semi-external approaches| {{:magistraleinformaticanetworking:ae:ae2013:mst-clr.pdf|Chap 23 of CLR}} and part of the {{:magistraleinformaticanetworking:ae:ae2013:clr_-_sp.pdf|chap on Shortest Path of CLR}} +
-|  | (Fully) external MST computationSteiner Tree problem: definition and a 2-approximate solution. Traveling Salesman Tour problem: definition and a 2-approximate solution. | {{:magistraleinformaticanetworking:ae:ae2012:mst-mehlhorn.pdf|sect 11.5 and 11.6}} of Sanders-Mehlhorn's book |+
magistraleinformaticanetworking/ae/ae2014/start.1432288656.txt.gz · Ultima modifica: 22/05/2015 alle 09:57 (9 anni fa) da Paolo Ferragina

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki