collaborators

1 paper

cs.DS2025

On the Complexity of the Ordered Covering Problem in Distance Geometry

Michael Souza, Júlio Araújo, John Kesley Costa +1

The Ordered Covering Problem (OCP) arises in the context of the Discretizable Molecular Distance Geometry Problem (DMDGP), where the ordering of pruning edges significantly impacts…