18 citations · 44 across the 26 of their papers we have counts for
4 papers · 1 filter
Almost optimal algorithms for diameter-optimally augmenting trees
Davide Bilò
We consider the problem of augmenting an -vertex tree with one shortcut in order to minimize the diameter of the resulting graph. The tree is embedded in an unknown space and we…
An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs
Davide Bilò, Kleitos Papadopoulos
In this draft we prove an interesting structural property related to the problem of computing {\em all the best swap edges} of a {\em tree spanner} in unweighted graphs. Previous p…
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
Davide Bilò, Kleitos Papadopoulos
Given a 2-edge connected, unweighted, and undirected graph with vertices and edges, a -tree spanner is a spanning tree of in which the ratio between the dist…
New algorithms for Steiner tree reoptimization
Davide Bilò
{\em Reoptimization} is a setting in which we are given an (near) optimal solution of a problem instance and a local modification that slightly changes the instance. The main goal…