18 citations · 44 across the 26 of their papers we have counts for
4 papers · 1 filter
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Let be given a graph whose edge set is partitioned into a set of \emph{red} edges and a set of \emph{blue} edges, and assume that red edges are weighted and form…
The Max-Distance Network Creation Game on General Host Graphs
Davide Bilò, Luciano Gualà, Stefano Leucci +1
In this paper we study a generalization of the classic \emph{network creation game} in the scenario in which the players sit on a given arbitrary \emph{host graph}, which const…
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…
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…