Stefano Leucci

Improved Purely Additive Fault-Tolerant Spanners

Let G be an unweighted n-node undirected graph. A β-additive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an additive term β w.r.t. the corresponding distances in G. A natural research goal related with spanners is that of designing sparse spanners with low stretch.

Fault-Tolerant Approximate Shortest-Path Trees

The resiliency of a network is its ability to remain effectively functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the requirement of being resilient. In this paper we address this trade-off for the prominent case of the broadcasting routing scheme, and we build efficient (i.e., sparse and fast) fault-tolerant approximate shortest-path trees, for both the edge and vertex single-failure case. In particular, for an n-vertex non-negatively weighted graph, and for any constant

Locality-based network creation games

\varepsilon >0

Network Creation Games with Traceroute-Based Strategies

ε>0, we design two structures of size

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

O\left( \frac{n \log n}{\varepsilon ^2}\right)

Compact and fast sensitivity oracles for single-source distances

Onlognε2 which guarantee