Proietti, Guido

1. Exact and approximate algorithms for movement problems on (special classes of) graphs
   2014/07/02 by Gualà, Davide Bilò Luciano, Leucci, Stefano, Proietti, Guido · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Improved Purely Additive Fault-Tolerant Spanners
   2015/07/02 by Davide Bilò, Fabrizio Grandoni, Bilò, Davide +7 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
   2016/01/16 by Bilò, Davide, Gualà, Luciano, Leucci, Stefano +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.2.2
4. Hardness, Approximability, and Fixed-Parameter Tractability of the\n Clustered Shortest-Path Tree Problem
   2018/01/31 by Mattia D’Emidio, Luca Forlizzi, D'Emidio, Mattia +7 · 1 citation
   Business, Management and Accounting · Engineering · Environmental Science · #Facility Location and Emergency Management #Asphalt Pavement Performance Evaluation #Municipal Solid Waste Management