18 citations · 76 across the 24 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014
Exact and approximate algorithms for movement problems on (special classes of) graphs
Davide Bilò Luciano Gualà, Stefano Leucci, Guido Proietti
When a large collection of objects (e.g., robots, sensors, etc.) has to be deployed in a given environment, it is often required to plan a coordinated motion of the objects from th…
cs.DS2014
Fault-Tolerant Approximate Shortest-Path Trees
Davide Bilò, Luciano Gualà, Stefano Leucci +1
The resiliency of a network is its ability to remain \emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a ne…