3 papers
cs.DS2025
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…
cs.CC2025
Monitoring graph edges via shortest paths: computational complexity and approximation algorithms
Giordano Colli
Edge-Geodetic Sets play a crucial role in network monitoring and optimization, wherein the goal is to strategically place monitoring stations on vertices of a network, represented…
cs.CC2024
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…