arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2512.03124cs.DScs.CG
收藏

有序覆盖问题在距离几何中的复杂性

On the Complexity of the Ordered Covering Problem in Distance Geometry

University of Campinas (IMECC-UNICAMP)(坎皮纳斯大学)

Michael Souza, Júlio Araújo, John Kesley Costa, Carlile Lavor

AI总结:

本文证明有序覆盖问题在距离几何中是NP难的,通过归约3-分区问题,为最优边顺序的计算复杂性提供了理论基础。

摘要:

有序覆盖问题(OCP)出现在离散化分子距离几何问题(DMDGP)的背景下,其中修剪边的顺序显著影响SBBU算法在蛋白质结构确定中的性能。在最近的工作中,Souza等人(2023)将OCP正式化为一个超图覆盖问题,具有有序的指数成本,并提出了一种贪心启发式方法,其性能优于原始SBBU顺序,相差数个数量级。然而,寻找最优解的计算复杂性仍是一个开放问题。在本文中,我们证明OCP是NP难的,通过多项式时间归约从强NP难的3-分区问题得出。我们的归约构造了一个紧预算,迫使最优解恰好对应有效的3-分区。这一结果为最优边顺序提供了计算障碍,并为实践中目前使用的启发式方法提供了理论依据。

英文摘要:

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 the performance of the SBBU algorithm for protein structure determination. In recent work, Souza et al. (2023) formalized OCP as a hypergraph covering problem with ordered, exponential costs, and proposed a greedy heuristic that outperforms the original SBBU ordering by orders of magnitude. However, the computational complexity of finding optimal solutions remained open. In this paper, we prove that OCP is NP-complete through a polynomial-time reduction from the strongly NP-complete 3-Partition problem. Our reduction constructs a tight budget that forces optimal solutions to correspond exactly to valid 3-partitions. This result establishes a computational barrier for optimal edge ordering and provides theoretical justification for the heuristic approaches currently used in practice.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑