18 citations · 44 across the 26 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
Davide Bilò, Feliciano Colella, Luciano Gualà +2
A tree -spanner of a positively real-weighted -vertex and -edge undirected graph is a spanning tree of which approximately preserves (i.e., up to a multiplicat…
cs.GT2017
On the Tree Conjecture for the Network Creation Game
Davide Bilò, Pascal Lenzner
Selfish Network Creation focuses on modeling real world networks from a game-theoretic point of view. One of the classic models by Fabrikant et al. [PODC'03] is the network creatio…
cs.DS2017
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges
Davide Bilò, Feliciano Colella, Luciano Gualà +2
Computing \emph{all best swap edges} (ABSE) of a spanning tree of a given -vertex and -edge undirected and weighted graph means to select, for each edge of , a…