Suppression Distance Computation for Set Covers and Hierarchies

François Queyroi (1) , Sergey Kirgizov (2)

1 ComplexNetworks
2 LIP6 - Laboratoire d'Informatique de Paris 6

We discuss the computation of the suppression distance between two set covers. It is the minimum number of element of a set that have to be removed so the renaming covers are equal. We show that this problem is NP-Hard by reduction to minimum vertex cover. We further investigate the subclass of hierarchies and prove this problem to be polynomial in this case as it gives birth to a class of perfect graphs. We also propose an algorithm based on recursive maximum assignments.

Mots clés: set cover; hierarchy; distance; graphs; vertex cover

Domaines: Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]

François Queyroi, Sergey Kirgizov. Suppression Distance Computation for Set Covers and Hierarchies. 2014. ⟨hal-00996090v1⟩