Strumenti Utente

Strumenti Sito


magistraleinformatica:alg2:algo2_14: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
magistraleinformatica:alg2:algo2_14:start [21/12/2014 alle 11:22 (10 anni fa)] – [Announcements] Roberto Grossimagistraleinformatica:alg2:algo2_14:start [04/10/2015 alle 10:06 (9 anni fa)] (versione attuale) Roberto Grossi
Linea 7: Linea 7:
   * Office hours: Thu 11-14 (Dipartimento di Informatica)   * Office hours: Thu 11-14 (Dipartimento di Informatica)
   * Next written examination dates (please register): Room C1, 09:00-11:00, Jan. 20, 2015. Room C1, 15:00-17:00, Feb. 11, 2015.   * Next written examination dates (please register): Room C1, 09:00-11:00, Jan. 20, 2015. Room C1, 15:00-17:00, Feb. 11, 2015.
-  * Next oral examination dates (meeting to fix dates): Teacher's office, 09:00, Jan. 22, 2015. Teacher's office,, 09:00, Feb. 16, 2015. +  * Next oral examination dates (meeting to fix dates): Teacher's office, 09:00, Jan. 14, 2015. Teacher's office, 09:00, Jan. 22, 2015. Teacher's office,, 09:00, Feb. 16, 2015.
 ==== Overview ==== ==== Overview ====
  
Linea 77: Linea 76:
 | Dec. 9| Notion of r-approximation algorithm. TSP: NP-hardness and difficulty of approximation. 2-approximation for metric TSP. | {{:magistraleinformatica:alg2:algo2_14:approxclrs.pdf| Except Sect.35.1}} | | Dec. 9| Notion of r-approximation algorithm. TSP: NP-hardness and difficulty of approximation. 2-approximation for metric TSP. | {{:magistraleinformatica:alg2:algo2_14:approxclrs.pdf| Except Sect.35.1}} |
 | Dec. 9| Problem solving (4 hours) | {{:magistraleinformatica:alg2:algo2_14:esercitazioni2014.pdf|list of problems}} | | Dec. 9| Problem solving (4 hours) | {{:magistraleinformatica:alg2:algo2_14:esercitazioni2014.pdf|list of problems}} |
-| Dec. 10| 2-approximation for MAX-CUT: local search, greedy. 2-approximation for minimum vertex cover. | [[http://www.cs.cmu.edu/afs/cs/academic/class/15854-f05/www/scribe/lec02.ps|Notes]]{{:magistraleinformatica:alg2:algo2_14:approxclrs.pdf| Sect.35.1}} |+| Dec. 10| 2-approximation for MAX-CUT: local search, greedy. 2-approximation for minimum vertex cover. | {{:magistraleinformatica:alg2:algo2_14:lec02.pdf|Notes}} {{:magistraleinformatica:alg2:algo2_14:approxclrs.pdf| Sect.35.1}} |
 | Dec. 11| Approximation for bin packing and knapsack. | [[http://www.dis.uniroma1.it/~ausiello/InfoTeoIIRM/book/chapter02.pdf| chapt.2: par. 2.1.1, par. 2.2.2]] | | Dec. 11| Approximation for bin packing and knapsack. | [[http://www.dis.uniroma1.it/~ausiello/InfoTeoIIRM/book/chapter02.pdf| chapt.2: par. 2.1.1, par. 2.2.2]] |
  
Linea 92: Linea 91:
 == Excercises discussed in class == == Excercises discussed in class ==
  
-This is the {{:magistraleinformatica:alg2:algo2_14:esercitazioni2014.pdf|final list}} of problems. Some of the [[https://www.dropbox.com/sh/4gseckzpbyix3mm/AABZj_Lp06BwMuy_CyVOQWgqa?dl=0|screen snapshots]] shown in the classroom.+This is the {{:magistraleinformatica:alg2:algo2_14:esercitazioni2014.pdf|final list}} of problems. Some of the [[https://www.dropbox.com/sh/dxj7dm1u0tjebf6/AAAqDxclSXVdrOIibNLLu2qoa?dl=0|screen snapshots]] shown in the classroom.
  
 == Official class documents == == Official class documents ==
Linea 100: Linea 99:
  
 == Examination outcomes (in Italian) == == Examination outcomes (in Italian) ==
 +  * No more accessible
 +
magistraleinformatica/alg2/algo2_14/start.1419160946.txt.gz · Ultima modifica: 21/12/2014 alle 11:22 (10 anni fa) da Roberto Grossi

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki