SlidesDelleLezioni < Algoreti

Tags: view all tags
----
---+++ <font color="blue" size="+3">Slides A.y. 2023-2024</font>

Please, download here the slides that will be projected during the lessons.
If possible, print them BEFORE attending the lessons. 

They are in easy-reading style, especially useful for students with specific learning disabilities.

Remember: studying on these slides is not enough to take the exam: they are useful to follow the order of the topics.

Note: the files contain 4 slides per page. If you prefer another format, please let me know.
---

Di seguito, le slides usate per le lezioni.
Se potete, stampatele PRIMA di venire a lezione. 

Sono in stile ad alta leggibilità, particolarmente utile per gli studenti con DSA.

Ricordate che le slides NON sono sufficienti per studiare, tuttavia sono utili per seguire il filo degli argomenti da ritrovare sulle varie fonti.

Nota: I files contengono 4 slides in ogni pagina. Se preferite avere un altro formato, fatemelo sapere.
---
   * 0 - Introduction to the Course
   * [[%ATTACHURL%/0IntroductionEngl_23_24_4pp.pdf][0IntroductionEngl_23_24_4pp.pdf]]
   * [[%ATTACHURL%/0IntroductionEngl_23_24_2pp.pdf][0IntroductionEngl_23_24_2pp.pdf]]


   * 1 - Routing i.e. Shortest Path
   * [[%ATTACHURL%/1ShortestPathEngl_23_24_4pp.pdf][1ShortestPathEngl_23_24_4pp.pdf]]
   * [[%ATTACHURL%/1ShortestPathEngl_23_24_2pp.pdf][1ShortestPathEngl_23_24_2pp.pdf]]


   * 2 - Layout i.e. Orthogonal Graph Drawing
   * [[%ATTACHURL%/2LayoutEngl_23_24_4pp.pdf][2LayoutEngl_23_24_4pp.pdf]]
   * [[%ATTACHURL%/2LayoutEngl_23_24_2pp.pdf][2LayoutEngl_23_24_2pp.pdf]]

   * 3 - Worm detection/infection i.e. Vertex Cover
   * [[%ATTACHURL%/3aVertexCoverEngl_23_24_4pp.pdf][3aVertexCoverEngl_23_24_4pp.pdf]]
   * [[%ATTACHURL%/3aVertexCoverEngl_23_24_2pp.pdf][3aVertexCoverEngl_23_24_2pp.pdf]]

   * 4 - Frequency assignment i.e. L(h,k)-labeling
   * [[%ATTACHURL%/4LhkEngl_23_24_4pp.pdf][4LhkEngl_23_24_4pp.pdf]]
   * [[%ATTACHURL%/4LhkEngl_23_24_2pp.pdf][4LhkEngl_23_24_2pp.pdf]]

   * 5 - Min Broadcast i.e. Min Spanning Tree
   * [[%ATTACHURL%/5MinSpanningTreeEng_23_24_4pp.pdf][5MinSpanningTreeEng_23_24_4pp.pdf]]
   * [[%ATTACHURL%/5MinSpanningTreeEng_23_24_2pp.pdf][5MinSpanningTreeEng_23_24_2pp.pdf]]

   * 6 - Data Mule i.e. TSP
   * [[%ATTACHURL%/6DataMuleEngl_23_24_4pp.pdf][6DataMuleEngl_23_24_4pp.pdf]]
   * [[%ATTACHURL%/6DataMuleEngl_23_24_2pp.pdf][6DataMuleEngl_23_24_2pp.pdf]]

   * 7 - Data Collection i.e. Connected Dominating Set
   * [[%ATTACHURL%/7ConnDominatingSet_23_24_2pp.pdf][7ConnDominatingSet_23_24_2pp.pdf]]
   * [[%ATTACHURL%/7ConnDominatingSet_23_24_4pp.pdf][7ConnDominatingSet_23_24_4pp.pdf]]

   * 8 - Centralized sensor Deployment i.e. min weight perfect Matching
   * [[%ATTACHURL%/8MatchingEngl_23_24_4pp.pdf][8MatchingEngl_23_24_4pp.pdf]] - new version 21 Nov. 2023
   * [[%ATTACHURL%/8MatchingEngl_23_24_2pp.pdf][8MatchingEngl_23_24_2pp.pdf]] - new version 21 Nov. 2023

   * 9 - Distributed sensor Deployment i.e. Construction of the Voronoi Diagram
   * [[%ATTACHURL%/9Voronoi_23_24_4pp.pdf][9Voronoi_23_24_4pp.pdf]]
   * [[%ATTACHURL%/9Voronoi_23_24_2pp.pdf][9Voronoi_23_24_2pp.pdf]]

   * 10 - Monitoring by UAVs i.e. What? Some ongoing problems
   * [[%ATTACHURL%/10UAVs_23_24_4pp.pdf][10UAVs_23_24_4pp.pdf]] - new version 21 Nov. 2023
   * [[%ATTACHURL%/10UAVs_23_24_2pp.pdf][10UAVs_23_24_2pp.pdf]] - new version 21 Nov. 2023

   * 11 - Other networks Some ongoing problems
   * [[%ATTACHURL%/11OtherNetworks_23_24_4pp.pdf][11OtherNetworks_23_24_4pp.pdf]]
   * [[%ATTACHURL%/11OtherNetworks_23_24_2pp.pdf][11OtherNetworks_23_24_2pp.pdf]]


---
---+++ <font color="blue" size="+3">Slides previous academic years </font>
In fact, they are not useful; they are here just for completeness...

---+++ <font color="blue" size="+1">Slides A.y. 2022-2023</font>

   * [[%ATTACHURL%/0IntroductionEngl_22_23_4pp.pdf][0IntroductionEngl_22_23_4pp.pdf]]: 0 - Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl_22_23_4pp.pdf][1ShortestPathEngl_22_23_4pp.pdf]]: 1 - Routing i.e. Shortest Path

   * [[%ATTACHURL%/2LayoutEngl_22_23_4pp.pdf][2LayoutEngl_22_23_4pp.pdf]]: 2 - Layout i.e. Orthogonal Graph Drawing

   * [[%ATTACHURL%/3aVertexCoverEngl_22_23_4pp.pdf][3aVertexCoverEngl_22_23_4pp.pdf]]: 3a - Worm detection/infection i.e. Vertex Cover

   * [[%ATTACHURL%/3bSetCoverEngl_22_23_4pp.pdf][3bSetCoverEngl_22_23_4pp.pdf]]: 3b - Circuit minimization i.e. Set Cover

   * [[%ATTACHURL%/4LhkEngl_22_23_4pp.pdf][4LhkEngl_22_23_4pp.pdf]]: 4 - Frequency assignment i.e. L(h,k)-labeling

   * [[%ATTACHURL%/5MinSpanningTreeEng_22_23_4pp.pdf][5MinSpanningTreeEng_22_23_4pp.pdf]]: 5 - Min Broadcast i.e. Min Spanning Tree

   * [[%ATTACHURL%/6DataMuleEngl_22_23_4pp.pdf][6DataMuleEngl_22_23_4pp.pdf]]: 6 - Data Mule i.e. TSP

   * [[%ATTACHURL%/7ConnDominatingSet_22_23_4pp.pdf][7ConnDominatingSet_22_23_4pp.pdf]]: 7 - Data Collection i.e. Connected Dominating Set

   * [[%ATTACHURL%/8MatchingEngl_22_23_4pp.pdf][8MatchingEngl_22_23_4pp.pdf]]: 8 - Centralized sensor Deployment i.e. min weight perfect Matching

   * [[%ATTACHURL%/guided_path_to_access_student_s_opinions_questionnaire_2022_2023.pdf][guided_path_to_access_student_s_opinions_questionnaire_2022_2023.pdf]]: guided path to access students opinions questionnaire2022/2023 - OPIS code: R053WYBC


   * [[%ATTACHURL%/9Voronoi_22_23_4pp.pdf][9Voronoi_22_23_4pp.pdf]]: 9 - Distributed sensor Deployment i.e. Construction of the Voronoi Diagram


   * [[%ATTACHURL%/10UAVs_22_23_4pp.pdf][10UAVs_22_23_4pp.pdf]]: 10 - Monitoring by UAVs i.e. what?

---+++ <font color="blue" size="+1">Slides A.y. 2021-2022</font>
   * [[%ATTACHURL%/0IntroductionEngl21_22_4pp.pdf][0IntroductionEngl21_22_4pp.pdf]]: 0 - Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl21_22_4pp.pdf][1ShortestPathEngl21_22_4pp.pdf]]: 1 - Routing i.e. Shortest Path

   * [[%ATTACHURL%/2LayoutEngl21_22_4pp.pdf][2LayoutEngl21_22_4pp.pdf]]: 2 - Layout i.e. Orthogonal Graph Drawing

   * [[%ATTACHURL%/3aVertexCoverEngl21_22_4pp.pdf][3aVertexCoverEngl21_22_4pp.pdf]]: 3a - Worm detection/infection i.e. Vertex Cover

   * [[%ATTACHURL%/3bSetCoverEngl21_22_4pp.pdf][3bSetCoverEngl21_22_4pp.pdf]]: 3b - Circuit minimization i.e. Set Cover

   * [[%ATTACHURL%/4LhkEngl21_22_4pp.pdf][4LhkEngl21_22_4pp.pdf]]: 4 - Frequency assignment i.e. L(h,k)-labeling

   * [[%ATTACHURL%/5MinSpanningTreeEng21_22_4pp.pdf][5MinSpanningTreeEng21_22_4pp.pdf]]: 5 - Min Broadcast i.e. Min Spanning Tree

   * [[%ATTACHURL%/6DataMule21_22_4pp.pdf][6DataMule21_22_4pp.pdf]]: 6 - Data Mule i.e. TSP 

   * [[%ATTACHURL%/7MatchingEngl21_22_4pp.pdf][7MatchingEngl21_22_4pp.pdf]]: 7 - Centralized sensor Deployment i.e. min weight perfect Matching

   * [[%ATTACHURL%/8VoronoiEng21_22_4pp.pdf][8VoronoiEng21_22_4pp.pdf]]: 8 - Distributed sensor Deployment i.e. Construction of the Voronoi Diagram

   * [[%ATTACHURL%/9UAVs21_22_4pp.pdf][9UAVs21_22_4pp.pdf]]: 9 - Monitoring by UAVs: some theses' proposals

   * [[%ATTACHURL%/After2CophyEngl21_22_4pp.pdf][After2CophyEngl21_22_4pp.pdf]]: A parenthesis: some thesis proposals


---+++ <font color="blue" size="+1">Slides A.y. 2020-2021</font>
   * [[%ATTACHURL%/0IntroductionEngl20_21_4pp.pdf][0IntroductionEngl20_21_4pp.pdf]]: 0 - Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl20_21_4pp.pdf][1ShortestPathEngl20_21_4pp.pdf]]: 1 - Routing i.e. Shortest Path

   * [[%ATTACHURL%/2LayoutEngl20_21_4pp.pdf][2LayoutEngl20_21_4pp.pdf]]: 2 - Layout i.e. Orthogonal Graph Drawing

   * [[%ATTACHURL%/3aVertexCoverEngl20_21_4pp.pdf][3aVertexCoverEngl20_21_4pp.pdf]]: 3a - Worm i.e. Vertex Cover - updated on Oct.19

   * [[%ATTACHURL%/3bSetCoverEngl20_21_4pp.pdf][3bSetCoverEngl20_21_4pp.pdf]]: 3b - Boolean Circuit Minimization i.e. Set Cover

   * [[%ATTACHURL%/4LhkEngl20_21_4pp.pdf][4LhkEngl20_21_4pp.pdf]]: 4 - Frequency Assignment i.e. L(h,k)-labeling

   * [[%ATTACHURL%/10Cophy_20_21_4pp.pdf][10Cophy_20_21_4pp.pdf]]: 10 - Co-phylogeny - some further theses' proposals - NEW (because of an error, it was the old version)

   * [[%ATTACHURL%/5MinSpanningTreeEng20_21_4pp.pdf][5MinSpanningTreeEng20_21_4pp.pdf]]: 5 - Min Broadcast i.e. Min Spanning Tree

   * [[%ATTACHURL%/6DataMuleEngl20_21_4pp.pdf][6DataMuleEngl20_21_4pp.pdf]]: 6 - Data Mule i.e. TSP

   * [[%ATTACHURL%/7MatchingEngl20_21_4pp.pdf][7MatchingEngl20_21_4pp.pdf]]: 7 - Centralized Deployment i.e. Max Matching

   * [[%ATTACHURL%/8VoronoiEng20_21_4pp.pdf][8VoronoiEng20_21_4pp.pdf]]: 8 - Distributed Deployment i.e. Voronoi Diagram Construction

   * [[%ATTACHURL%/9UAVs_20_21_4pp.pdf][9UAVs_20_21_4pp.pdf]]: 9 - UAVs: some theses' proposals

   * [[%ATTACHURL%/Seminario_Sapienza_20201209.pdf][Seminario_Sapienza_20201209.pdf]]: Slides by Federico Corò


---+++ <font color="blue" size="+1">Slides A.y. 2019-2020</font>
   * [[%ATTACHURL%/0IntroductionEngl19_20_4pp.pdf][0IntroductionEngl19_20_4pp.pdf]]: 0- Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl19_20_4ppA.pdf][1ShortestPathEngl19_20_4ppA.pdf]]: 1- Routing-Shortest Path part A

   * [[%ATTACHURL%/1ShortestPathEngl19_20_4ppB.pdf][1ShortestPathEngl19_20_4ppB.pdf]]: 1- Routing-Shortest Path part B

   * [[%ATTACHURL%/1ShortestPathEngl19_20_4ppC.pdf][1ShortestPathEngl19_20_4ppC.pdf]]: 1- Routing-Shortest Path part C (Corrected version: Oct 1st)

   * [[%ATTACHURL%/2LayoutEngl19_20_4ppA.pdf][2LayoutEngl19_20_4ppA.pdf]]: 2- Layout-Orthogonal Graph Drawing part A

   * [[%ATTACHURL%/2LayoutEngl19_20_4ppB.pdf][2LayoutEngl19_20_4ppB.pdf]]: 2- Layout-Orthogonal Graph Drawing part B

   * [[%ATTACHURL%/3aVertexCoverEngl19_20_4pp.pdf][3aVertexCoverEngl19_20_4pp.pdf]]: 3a- Worm-VertexCover

   * [[%ATTACHURL%/3bSetCoverEngl19_20_4pp.pdf][3bSetCoverEngl19_20_4pp.pdf]]: 3b- Circuit Minimization-SetCover (Corrected version: Nov 6th)

   * [[%ATTACHURL%/4LhkEngl19_20_4ppA.pdf][4LhkEngl19_20_4ppA.pdf]]: 4- Frequency assignment-L(h,k)-labeling part A

   * [[%ATTACHURL%/4LhkEngl19_20_4ppB.pdf][4LhkEngl19_20_4ppB.pdf]]: 4- Frequency assignment-L(h,k)-labeling part B

   * [[%ATTACHURL%/5MinSpanningTreeEng19_20_4ppA.pdf][5MinSpanningTreeEng19_20_4ppA.pdf]]: 5- Min Broadcast-Min Spanning Tree part A

   * [[%ATTACHURL%/5MinSpanningTreeEng19_20_4ppB.pdf][5MinSpanningTreeEng19_20_4ppB.pdf]]: 5- Min Broadcast-Min Spanning Tree part B (Corrected version: Nov 6th)

   * [[%ATTACHURL%/6DataMuleEngl_19_20_4pp.pdf][6DataMuleEngl_19_20_4pp.pdf]]: 6- Data Mule-TSP

   * [[%ATTACHURL%/7MatchingEngl19_20_4ppA.pdf][7MatchingEngl19_20_4ppA.pdf]]: 7- Centralized Deployment-Min Weighted Matching in bipartite graphs part A

   * [[%ATTACHURL%/7MatchingEngl19_20_4ppB.pdf][7MatchingEngl19_20_4ppB.pdf]]: 7- Centralized Deployment-Min Weighted Matching in bipartite graphs part B

   * [[%ATTACHURL%/8VoronoiEng19_20_4ppA.pdf][8VoronoiEng19_20_4ppA.pdf]]: 8- Distributed Deployment-Voronoi Diagram part A
      * [[%ATTACHURL%/HomVF.wmv][HomVF.wmv]]: Homogeneous sensors virtual force based algorithm
      * [[%ATTACHURL%/HomVor.wmv][HomVor.wmv]]: Homogeneous sensors Voronoi based algorithm

   * [[%ATTACHURL%/8VoronoiEng19_20_4ppB.pdf][8VoronoiEng19_20_4ppB.pdf]]: 8- Distributed Deployment-Voronoi Diagram part B
      * [[%ATTACHURL%/heterogeneous.wmv][HetVor.wmv]]: Heterogeneous sensors Voronoi based algorithm
      * [[%ATTACHURL%/vorLag.wmv][HetVorLag.wmv]]: Heterogeneous sensors Voronoi-Laguerre based algorithm

   * [[%ATTACHURL%/9UAVsEng19_20_4pp.pdf][9UAVsEng19_20_4pp.pdf]]: 9- UAVs - theses' proposals

   * [[%ATTACHURL%/10Cophy19_20_4pp.pdf][10Cophy19_20_4pp.pdf]]: 10- Co-phylogeny - further theses' proposals

---
---+++ <font color="blue" size="+1">Slides A.y. 2018-2019</font>
   * [[%ATTACHURL%/0IntroductionEngl18_19_4pp.pdf][0IntroductionEngl18_19_4pp.pdf]]: 0- Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl18_19_4ppA.pdf][1ShortestPathEngl18_19_4ppA.pdf]]: 1- Routing-Shortest Path part A

   * [[%ATTACHURL%/1ShortestPathEngl18_19_4ppB.pdf][1ShortestPathEngl18_19_4ppB.pdf]]: 1- Routing-Shortest Path part B

   * [[%ATTACHURL%/1ShortestPathEngl18_19_4ppC.pdf][1ShortestPathEngl18_19_4ppC.pdf]]: 1- Routing-Shortest Path part C

   * [[%ATTACHURL%/2LayoutEngl18_19_4ppA.pdf][2LayoutEngl18_19_4ppA.pdf]]: 2- Layout-Orthogonal Graph Drawing part A

   * [[%ATTACHURL%/2LayoutEngl18_19_4ppB.pdf][2LayoutEngl18_19_4ppB.pdf]]: 2- Layout-Orthogonal Graph Drawing part B

   * [[%ATTACHURL%/3aVertexCoverEngl18_19_4pp.pdf][3aVertexCoverEngl18_19_4pp.pdf]]: 3a- Worm-VertexCover

   * [[%ATTACHURL%/3bSetCoverEngl18_18_4pp.pdf][3bSetCoverEngl18_18_4pp.pdf]]: 3b- Circuit Minimization-SetCover

   * [[%ATTACHURL%/4LhkEngl18_19_4ppA.pdf][4LhkEngl18_19_4ppA.pdf]]: 4- Frequency Assignment part A

   * [[%ATTACHURL%/4LhkEngl18_19_4ppB.pdf][4LhkEngl18_19_4ppB.pdf]]: 4- Frequency Assignment part B

   * [[%ATTACHURL%/5MinSpanningTreeEng18_19_4ppA.pdf][5MinSpanningTreeEng18_19_4ppA.pdf]]: 5- Min Spanning Tree part A

   * [[%ATTACHURL%/5MinSpanningTreeEng18_19_4ppB.pdf][5MinSpanningTreeEng18_19_4ppB.pdf]]: 5- Min Spanning Tree part B

   * [[%ATTACHURL%/6DataMuleEngl_18_19_4pp.pdf][6DataMuleEngl_18_19_4pp.pdf]]: 6- Data Mule

   * [[%ATTACHURL%/7MatchingEngl18_19_4ppA.pdf][7MatchingEngl18_19_4ppA.pdf]]: 7- Max Weighted Matching part A

   * [[%ATTACHURL%/7MatchingEngl18_19_4ppB.pdf][7MatchingEngl18_19_4ppB.pdf]]: 7- Max Weighted Matching part B

   * [[%ATTACHURL%/8VoronoiEng18_19_4ppA.pdf][8VoronoiEng18_19_4ppA.pdf]]: 8- Voronoi Diagrams part A

   * [[%ATTACHURL%/8VoronoiEng18_19_4ppB.pdf][8VoronoiEng18_19_4ppB.pdf]]: 8- Voronoi Diagrams part B
      * [[%ATTACHURL%/HomVF.wmv][HomVF.wmv]]: Homogeneous sensors virtual force based algorithm
      * [[%ATTACHURL%/HomVor.wmv][HomVor.wmv]]: Homogeneous sensors Voronoi based algorithm
      * [[%ATTACHURL%/heterogeneous.wmv][HetVor.wmv]]: Heterogeneous sensors Voronoi based algorithm
      * [[%ATTACHURL%/vorLag.wmv][HetVorLag.wmv]]: Heterogeneous sensors Voronoi-Laguerre based algorithm

   * [[%ATTACHURL%/9UAVsEng18_19_4pp.pdf][9UAVsEng18_19_4pp.pdf]]: 9- Monitoring by UAVs + some theses proposals

   * [[%ATTACHURL%/presentazione.pdf][9UAVs_Silvestri_1.pdf]]: 9- Slides Prof. Silvestri 1/2

   * [[%ATTACHURL%/slides-icc-1.pdf][9UAVs_Silvestri_2.pdf]]: 9- Slides Prof. Silvestri 2/2

----
---+++ <font color="blue" size="+1">Slides A.y. 2017-2018</font>

   * [[%ATTACHURL%/0IntroductionEngl17_18_4pp.pdf][0IntroductionEngl17_18_4pp.pdf]]: 0- Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl17_18_4pp.zip][1ShortestPathEngl17_18_4pp.zip]]: 1- Routing-ShortestPath

   * [[%ATTACHURL%/2LayoutEngl17_18_4pp.pdf][2LayoutEngl17_18_4pp.pdf]]: 2- Layout - Orthogonal Graph Drawing - NEW VERSION WITH SOME CORRECTIONS

   * [[%ATTACHURL%/3aVertexCoverEngl17_18_4pp.pdf][3aVertexCoverEngl17_18_4pp.pdf]]: 3a- Worm detection/infection - Min Vertex Cover

   * [[%ATTACHURL%/3bSetCoverEngl.pdf][3bSetCoverEngl.pdf]]: 3b- Boolean Circuit minimization - Set Cover

   * [[%ATTACHURL%/4LhkEngl17_18_4pp.pdf][4LhkEngl17_18_4pp.pdf]]: 4- Frequency assignment problem - L(h,k)-labeling

   * [[%ATTACHURL%/5MinSpanningTree17_18_4pp.pdf][5MinSpanningTree17_18_4pp.pdf]]: 5- Min Broadcast - Min Spanning Tree

   * [[%ATTACHURL%/6DataMule17_18_4pp.pdf][6DataMule17_18_4pp.pdf]]: 6- Data Mule - TSP

   * [[%ATTACHURL%/7MatchingEngl17_18_4pp.pdf][7MatchingEngl17_18_4pp.pdf]]: 7- Centralized Deployment - Min Weight Matching

   * [[%ATTACHURL%/8VoronoiEng17_18_4pp.pdf][8VoronoiEng17_18_4pp.pdf]]: 8- Distributed Deployment - Voronoi Diagrams

   * [[%ATTACHURL%/9UAVs17_18_4pp.pdf][9UAVs17_18_4pp.pdf]]: 9- Monitoring by UAVs - some theses proposals

   * [[%ATTACHURL%/10Cophy.pdf][10Cophy.pdf]]: 10- Co-phylogeny - some further theses proposals

----
---+++ <font color="blue" size="+1">Slides A.y. 2016-2017</font>

   * [[%ATTACHURL%/0IntroductionEngl16_17_4pp.pdf][0IntroductionEngl16_17_4pp.pdf]]: 0- Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl16_17_4pp.pdf][1ShortestPathEngl16_17_4pp.pdf]]: 1- Routing-ShortestPath

   * [[%ATTACHURL%/2LayoutEngl16_17_4pp.pdf][2LayoutEngl16_17_4pp.pdf]]: 2- Layout - Orthogonal Graph Drawing (new version after the lesson: some small errors have been corrected)

   * [[%ATTACHURL%/3aVertexCoverEngl16_17_4pp.pdf][3aVertexCoverEngl16_17_4pp.pdf]]: 3a - Vertex Cover - Worm detection/propagation

   * [[%ATTACHURL%/3bSetCoverEngl16_17_4pp.pdf][3bSetCoverEngl16_17_4pp.pdf]]: 3b - Set Cover - Boolean Circuit minimization

   * [[%ATTACHURL%/4LhkEngl16_17_4pp.pdf][4LhkEngl16_17_4pp.pdf]]: 4 - L(h,k)-labeling - Frequency assignment

   * [[%ATTACHURL%/5MinSpanningTreeEng16_17_4pp.pdf][5MinSpanningTreeEng16_17_4pp.pdf]]: 5 - Minimum Spanning Tree - Minimum Energy Broadcast

   * [[%ATTACHURL%/6DataMule16_17_4pp.pdf][6DataMule16_17_4pp.pdf]]: 6 - Data Mule Scheduling - Traveling Salesperson Problem

   * [[%ATTACHURL%/7Matching16_17_4pp.pdf][7Matching16_17_4pp.pdf]]: 7 - Maximum matching in bipartite graphs - Centralized deployment of mobile sensors

   * [[%ATTACHURL%/8Voronoi16_17_4pp.pdf][8Voronoi16_17_4pp.pdf]]: 8 - Voronoi diagram construction problem - Distributed deployment of mobile sensors

*Videos of the last lessons:*

   * [[%ATTACHURL%/HomVF.wmv][HomVF.wmv]]: Homogeneous sensors virtual force based algorithm

   * [[%ATTACHURL%/HomVor.wmv][HomVor.wmv]]: Homogeneous sensors Voronoi based algorithm

   * [[%ATTACHURL%/HetVor.wmv][HetVor.wmv]]: Heterogeneous sensors Voronoi based algorithm

   * [[%ATTACHURL%/HetVorLag.wmv][HetVorLag.wmv]]: Heterogeneous sensors Voronoi-Laguerre based algorithm

----
---+++ <font color="blue" size="+1">Slides A.y. 2015-2016</font>

   * [[%ATTACHURL%/0IntroductionEngl15_16.pdf][0IntroductionEngl15_16.pdf]]: 0- Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl15_16.pdf][1ShortestPathEngl15_16.pdf]]: 1- Routing-ShortestPath

   * [[%ATTACHURL%/2LayoutEngl15_16.pdf][2LayoutEngl15_16.pdf]]: 2- Layout - Orthogonal Graph Drawing

   * [[%ATTACHURL%/3aVertexCoverEngl15_16.pdf][3aVertexCoverEngl15_16.pdf]]: 3a- Worm Detection - Vertex Cover

   * [[%ATTACHURL%/3bSetCoverEngl15_16.pdf][3bSetCoverEngl15_16.pdf]]: 3b- Boolean Circuit minimization - Set Cover

   * [[%ATTACHURL%/4L(h,k)Engl15_16.pdf][4L(h,k)Engl15_16.pdf]]: 4- Frequency Assignment - L(h,k)-labeling

   * [[%ATTACHURL%/5MinSpanningTreeEng15_16.pdf][5MinSpanningTreeEng15_16.pdf]]: 5- Min Spanning Tree - Min broadcast

   * [[%ATTACHURL%/6MatchingEngl15_16.pdf][6MatchingEngl15_16.pdf]]: 6- Maximum Matching - Centralized Deployment of mobile sensors

   * [[%ATTACHURL%/7VoronoiEng15_16.pdf][7VoronoiEng15_16.pdf]]: 7- Voronoi Diagram - Distributed Deployment of mobile sensors



---+++ <font color="blue" size="+1">Slides delle Lezioni A.y. 2014-2015</font>

   * [[%ATTACHURL%/0IntroductionEngl14_15.pdf][0IntroductionEngl14_15.pdf]]: Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl14_15.pdf][1ShortestPathEngl14_15.pdf]]: Routing - Shortest Path

   * [[%ATTACHURL%/2LayoutEngl14_15.pdf][2LayoutEngl14_15.pdf]]: Layout - Orthogonal Graph Drawing

   * [[%ATTACHURL%/3aVertexCoverEngl.pdf][3aVertexCoverEngl14_15.pdf]]: Worm propagation - Vertex Cover

   * [[%ATTACHURL%/3bSetCoverEngl14_15.pdf][3bSetCoverEngl14_15.pdf]]: Boolean Circuits - Set Cover

   * [[%ATTACHURL%/4L(h,k)Engl14_15.pdf][4L(h,k)Engl14_15.pdf]]: Frequency assignment - L(h,k)-labeling

   * [[%ATTACHURL%/5MinSpanningTreeEng14_15.pdf][5MinSpanningTreeEng14_15.pdf]]: Min broadcast - min Spanning Tree

   * [[%ATTACHURL%/6MatchingEngl14_15.pdf][6MatchingEngl14_15.pdf]]: centralized deployment - Weighted bipartite matching

---+++ <font color="blue" size="+1">Slides delle Lezioni A.y. 2013-2014</font>
   * [[%ATTACHURL%/0IntroductionEngl.pdf][0IntroductionEngl.pdf]]: Introduction to the Course

   * [[%ATTACHURL%/1ShortestPathEngl.pdf][1ShortestPathEngl.pdf]]: Routing - Shortest Path

   * [[%ATTACHURL%/2LayoutEngl.pdf][2LayoutEngl.pdf]]: Layout - Orthogonal Graph Drawing

   * [[%ATTACHURL%/3VertexCoverEngl.pdf][3VertexCoverEngl.pdf]]: Warm propagation - Vertex Cover

   * [[%ATTACHURL%/3bSetCoverEngl.pdf][3bSetCoverEngl.pdf]]: boolean circuits - Set Cover

   * [[%ATTACHURL%/4L(h,k)Engl.pdf][4L(h,k)Engl.pdf]]: Frequency assignment - L(h,k)-labeling

   * [[%ATTACHURL%/5MinSpanningTreeEng.pdf][5MinSpanningTreeEng.pdf]]: Min broadcast - min panning tree

   * [[%ATTACHURL%/6MatchingEngl.pdf][6MatchingEngl.pdf]]: Centralized Depolyment - Perfect Matching

   * [[%ATTACHURL%/7VoronoiEng.pdf][7VoronoiEng.pdf]]: Distributed Deployment - Voronoi Diagram

These are the slides of the lessons taught by the students (in a random order):

   * [[%ATTACHURL%/Cammarano_Sensor_Deployment.pdf][Sensor_Deployment.pdf]]: Slides by Diego Cammarano

   * [[%ATTACHURL%/MST_on_Planar_Graphs.pdf][MST_on_Planar_Graphs.pdf]]: Slides by Joao Fernandes

   * [[%ATTACHURL%/_Approximation_Factor_of_the_MST_Heuristic_for_the_Minimum_Energy_Broadcasting_-_Michele_Iovino.pdf]["Real"_Approximation_MST.pdf]]: Slides by Michele Iovino

   * [[%ATTACHURL%/Marco_Vitagliano_-_How_to_assign_channels_to_stations_in_a_grid_network.pdf][Channel_assignment_in_a_grid.pdf]]: Slides by Marco Vitagliano

---+++ <font color="blue" size="+1">Slides delle Lezioni A.A. 2012-2013</font>

Di seguito, le slides usate per le lezioni.
Se potete, stampatele PRIMA di venire a lezione.

Ricordate che le slides NON sono sufficienti per studiare, tuttavia sono utili per seguire il filo degli argomenti da ritrovare sulle varie fonti.

   * [[%ATTACHURL%/0Introduzione.pdf][0Introduzione.pdf]]: Introduzione al corso

   * [[%ATTACHURL%/1ShortestPath.pdf][1ShortestPath.pdf]]: Shortest path

   * [[%ATTACHURL%/2Layout.pdf][2Layout.pdf]]: Layout

   * [[%ATTACHURL%/3VertexCover.pdf][3VertexCover.pdf]]: Vertex Cover

   * [[%ATTACHURL%/4L(h,k).pdf][4L(h,k).pdf]]: L(h,k)-labeling

   * [[%ATTACHURL%/5MinSpanningTree.pdf][5MinSpTree.pdf]]: Min Spanning Tree

   * [[%ATTACHURL%/6Matching.pdf][6Matching.pdf]]: Matching Bipartito

   * [[%ATTACHURL%/7Voronoi.pdf][7Voronoi.pdf]]: Voronoi

---+++ <font color="blue" size="+1">Slides delle Lezioni A.A. 2011-2012</font>

Notare che alcune slides sono state compattate per ragioni di dimensioni e quindi le figure potrebbero avere bassa risoluzione nella stampa.
Sempre per ragioni di dimensioni del file, alcuni argomenti sono stati spezzati in più files, ma ho tentato di rendere chiara questa eventualità dai nomi dei files.

*Attenzione alle date!* alcuni files risalgono ancora all'anno scorso, ma sto mettendo in rete le nuove versioni.
Purtroppo, per motivi tecnici che il Prof. Sterbini sta cercando di risolvere, non riesco a mettere in rete le nuove slides in pdf, quindi trovate le slides in formato pptx

   * *Introduzione*
      * [[%ATTACHURL%/0Introduzione.pdf][0Introduzione.pdf]]: Slides introduttive sul corso - vers. A.A. 2011/2012

   * *Instradamento - Shortest Path*
      * [[%ATTACHURL%/1ShortestPath.pptx][1ShortestPath.pptx]]: Tutte le slides - vers. A.A. 2011/2012

   * *Layout - Disegno su griglia*
      * [[%ATTACHURL%/2Layout_A.pptx][2Layout_A.pptx]]: Prime 25 slides - vers. A.A. 2011/2012
      * [[%ATTACHURL%/2Layout_B.pptx][2Layout_B.pptx]]: Seconde 25 slides - vers. A.A. 2011/2012
      * [[%ATTACHURL%/2Layout_C.pptx][2Layout_C.pptx]]: Ultime slides - vers. A.A. 2011/2012

   * *Worm - Copertura di nodi*
      * [[%ATTACHURL%/3VertexCover.pptx][3VertexCover.pptx]]: - vers. A.A. 2011/2012

   * *Frequenze - L(h,k)-etichettatura*
      * [[%ATTACHURL%/4L(h,k).pptx][4L(h,k).pptx]]: - nuova vers. A.A. 2011/2012 (corretta dopo le lezioni)

   * *Min Energy Broadcast - min spanning tree*
      * [[%ATTACHURL%/5MinSpanningTree.pptx][5MinSpanningTree.pptx]]: - nuova vers. A.A. 2011/2012

   * *Dispiegamento centralizzato - matching bipartito*
      * [[%ATTACHURL%/6Matching.pptx][6Matching.pptx]]: - nuova vers. A.A. 2011/2012

   * *Dispiegamento distribuito - diagramma di Voronoi*
      * [[%ATTACHURL%/7Voronoi.pdf][7Voronoi.pdf]]: Slides - vers. A.A. 2010/2011

---+++ <font color="blue" size="+1">Slides delle Lezioni A.A. 2010-2011</font>

   * 
      * [[%ATTACHURL%/2Layout1-47.pdf][2Layout1-47.pdf]]: Prime 47 slides - vers. A.A. 2010/2011
      * [[%ATTACHURL%/2Layout48-fine.pdf][2Layout48-fine.pdf]]: Ultime slides - vers. A.A. 2010/2011

   * 
      * [[%ATTACHURL%/3VertexCover.pdf][3VertexCover.pdf]]: Slides - Nuova vers. dopo lezione - vers. A.A. 2010/2011

   * 
      * [[%ATTACHURL%/4L(h,k).pdf][4L(h,k).pdf]]: Slides - Nuova vers. con qualche pagina in piu' rispetto alla prima - vers. A.A. 2010/2011

   * 
      * [[%ATTACHURL%/5MinSpanningTree.pdf][5MinSpanningTree.pdf]]: Slides - vers. A.A. 2010/2011

   * 
      * [[%ATTACHURL%/6Matching1-35Reduced.pdf][6Matching1-35Reduced.pdf]]: Prime 35 slides (compattate) - vers. A.A. 2010/2011
      * [[%ATTACHURL%/6Matching36-fineReduced.pdf][6Matching36-fineReduced.pdf]]: Ultime slides (compattate) - vers. A.A. 2010/2011
Attachments
Topic attachments
I	Attachment	History	Action	Size	Date	Who
pdf	1ShortestPath.pdf	r2 r1	manage	8631.3 K	2012-10-02 - 09:02	TizianaCalamoneri
pdf	3aVertexCoverEngl16_17_4pp.pdf	r1	manage	4528.6 K	2016-10-12 - 09:32	TizianaCalamoneri
pdf	8VoronoiEng20_21_4pp.pdf	r2 r1	manage	20728.1 K	2020-11-17 - 09:58	TizianaCalamoneri