D. Frigioni

collaborators

2 papers

cs.DS2018

Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem

Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni +2

Given an $n$ -vertex non-negatively real-weighted graph $G$ , whose vertices are partitioned into a set of $k$ clusters, a \emph{clustered network design problem} on $G$ consists of…

cs.DS2015

Path-Fault-Tolerant Approximate Shortest-Path Trees

Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni +2

Let $G = (V, E)$ be an $n$ -nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of $G$ with a \emph{…