1 citations · 1 across the 4 of their papers we have counts for
4 papers
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
Davide Bilò, Giordano Colli, Luca Forlizzi +1
We study the minimum \emph{Monitoring Edge Geodetic Set} (\megset) problem introduced in [Foucaud et al., CALDAM'23]: given a graph , we say that an edge is monitored by a pair…
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
Davide Bilò, Giordano Colli, Luca Forlizzi +1
Given an undirected connected graph on vertices, the minimum Monitoring Edge-Geodetic Set (MEG-set) problem asks to find a subset of minim…
On the -Hamming and -Edit Distances
Chiara Epifanio, Luca Forlizzi, Francesca Marzi +3
In this paper we consider the weighted -Hamming and -Edit distances, that are natural generalizations of the classical Hamming and Edit distances. As main results of this pap…
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni +2
Given an -vertex non-negatively real-weighted graph , whose vertices are partitioned into a set of clusters, a \emph{clustered network design problem} on consists of…