Modifications to the schedule, grades, and other info will be made available through the Racó located at
FIB.

- Teaching staff
- Josep Díaz

*Campus Nord, Edif. Omega, Desp. 240*

E-mail: diaz at cs.upc.edu

Group 10 - Maria Blesa

*Campus Nord, Edif. Omega, Desp. 213*

E-mail: mjblesa at cs.upc.edu

Group 12 - Maria Serna (Responsible)

*Campus Nord, Edif. Omega, Desp. 235*

E-mail: mjserna at cs.upc.edu

Groups 11 and 13

- Josep Díaz
- Calendar
- Project Due date May 13th 2019
- Mid term exam April 10th, 2019 (12:00-14:30)
- Final exam June 11th, 2019 (15:00-18:00)
- Course Roadmap
- 1. Basic algorithmic concepts
- 2. Greedy algorithmic
- 3. Dynamic Programming and graph distances
- Dynamic programming
- Graph distances
- On the history of the shortest path problem by Alexander Schrijver
- 4. Flow in Networks. Linear Programming
- 5. Other algorithmic techniques

- Lists of problems

- List 1 (consecutive , 1 per page)
- List 2 (consecutive , 1 per page)
- List 3 (consecutive , 1 per page)
- List 4 (consecutive , 1 per page)
- List 5 (consecutive , 1 per page)

- Some links that might be useful