2 papers
cs.CC2023
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…
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 -vertex non-negatively real-weighted graph , whose vertices are partitioned into a set of clusters, a \emph{clustered network design problem} on consists of…