ProgrammaLezioniDegliStudenti < Algoreti

---+ Student Lessons' Schedule

---+ <font color=red size="+2">
A.A. 2024/25</font>

1.1. The Routing problem i.e. the minimum cost shortest path

   * [Lal16] Tommaso Federici
   * [NCO13] Armando Coppola
   * [WLC16] Radu Ionut Barbalata

1.2. The layout of interconnection networks i.e. the orthogonal grid graph drawing

   * [L80] Markos Peral Catala

1.3. The problem of infecting a network with a worm i.e. the minimum vertex cover problem

   * [Aal18] Fabian Stiewe 
   * [KM09] Matthias Kuhn

2.1. The frequency assignment problem i.e. a graph coloring problem

   * [BKTL04] Simone Bianco
   * [Xal14] Andrea Donato

2.2. The minimum energy broadcast problem i.e. the minimum spanning tree problem
   * [N08] Tommaso Leonardi

3.1. The data mule scheduling problem i.e. the traveling salesman problem

3.2. The data Collection in ad-hoc networks i.e. the connected Dominating Set Problem
   * [LL23] Alessio Bandiera

4.1. The centralized deployment of a mobile sensor network i.e. the minimum cost perfect matching in bipartite graphs

   * [Fal10] Jemuel Espiritu Fuentes
   * [Dal10] Giuseppe Carnicella

4.2. Self-deployment of a mobile sensor network i.e. the Voronoi Diagram

   * [HV05] Simone Giovagnoni 
   * [Kal14] Roberta Ronchetti

4.3. Monitoring by UAVs i.e. what?

   * [CB05] Thomas Bousquet
--

[[SchedulePreviousYears][Schedule of the Previous Years]]
---+ <font color=red size="+2">


-- %USERSIG{TizianaCalamoneri - 2017-10-25}%



%COMMENT%

   * [[%ATTACHURL%/Prata_MIN-3-AC.pdf][Prata_MIN-3-AC.pdf]]: Prata_MIN-3-AC.pdf
This topic: Algoreti > WebHome1011 > ProgrammaLezioniDegliStudenti
Topic revision: r88 - 2024-11-14 - TizianaCalamoneri