18 citations · 44 across the 26 of their papers we have counts for
Showing 2018 · cs.DSShow all
3 papers · 2 filters
cs.DS2018
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…
cs.DS2018
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…
cs.DS2018
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…