network algorithms

Dear students,

During the algorithm courses you have already attended, you have been told that algorithms in general, and graph algorithms in particular, are important because they are able to model the solution of a number of real-life problems: designing a good algorithm often turns out to have a good solution for the initial problem. Nevertheless, probably no one explained to you what these real-life problems are.

During this course, I will show you many real-life problems arising from using communication networks (cable or wireless networks, fixed or mobile networks), and, for each of them, we will discuss together how a problem can be modeled as a classical graph problem and solved by means of a graph algorithm, proposing sometimes more than one solution. In the first part of the course, I will propose some classical problems (together with their algorithmic solutions). In the second part of the course, I will address some advanced problems, particularly those related to wireless, ad hoc, and sensor networks. Of course, these latter problems are particularly feasible to be studied in a master's thesis, with good prospects for finding some new results.

It is worth noting that the course's approach is algorithmic, so special emphasis is placed on the method used to find the optimal solution, or at least the best possible one. This also means that you should have knowledge of non-trivial algorithms, data structures, and the foundation of computational complexity, in order to attend this course with profit.

Timetable

Monday 10:00  - 13:00 Room G-50 (Viale Regina Elena 295 - RM115-E01P03L001)

Thursday 14:00 - 16:00 Room G-50 (Viale Regina Elena 295 - RM115-E01P03L001)

Office hours

write an e-mail to calamo at di dot uniroma1 dot it to get an appointment