arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2606.08412cs.DScs.CC
收藏

一元易位距离的复杂性与算法

Complexity and Algorithms for Unary Translocation Distance

Department of Computer Science, University of Bucharest(布加勒斯特大学计算机系)

Maria Constantin, Adrian Miclăuş, Alexandru Popa, Andrei Popa

AI总结:

研究计算一元易位距离的复杂性,证明其为强NP难,并给出固定|B|的伪多项式精确算法、2-近似算法及参数化算法。

摘要:

给定一个有限整数集 $A$,一个\emph{一元易位}操作产生一个新集 $A' = A \cup \{u,v\}$,其中 $u$ 和 $v$ 是非负整数,满足存在 $x,y\in A$ 使得 $x+y=u+v$。对于输入集 $A$ 和目标集 $B$,\emph{一元易位距离}是获得包含 $B$ 的超集所需的最小一元易位次数。在本文中,我们从理论和计算两个角度研究该问题。我们证明计算一元易位距离是强NP难的,从而回答了 \citet{ConstantinMiclausPopa2026UnaryTranslocation} 提出的一个开放问题。在积极方面,我们针对 $|B|$ 的每个固定常数值给出了一个精确的伪多项式算法,扩展了我们之前针对 $|B|\leq 2$ 的结果。对于任意目标集,我们提出了一个 $2$-近似算法、一个加法 $(|B|-1)$-近似算法,并证明加法算法也产生 $3$-近似。我们还提出了参数化算法,包括以输入集中的最大值与最优距离为参数的算法,以及以目标集中的最大值与 $|B|$ 为参数的算法。此外,我们提出了一个整数线性规划公式,为该问题提供了精确的数学模型,分析了其规模,并证明LP松弛的完整性间隙至少为 $\frac{4}{3}$。最后,我们报告了比较 $2$-近似算法、束搜索和模拟退火的计算实验。结果表明,近似算法在实践中非常有效,并且通常优于启发式基线。

英文摘要:

Given a finite set of integers $A$, a \emph{unary translocation} produces a new set $A' = A \cup \{u,v\}$, where $u$ and $v$ are nonnegative integers satisfying $x+y=u+v$ for some $x,y\in A$. For an input set $A$ and a target set $B$, the \emph{unary translocation distance} is the minimum number of unary translocations required to obtain a superset containing $B$. In this paper, we study this problem from both theoretical and computational perspectives. We prove that computing the unary translocation distance is strongly NP-hard, thereby answering an open question raised by \citet{ConstantinMiclausPopa2026UnaryTranslocation}. On the positive side, we give an exact pseudo-polynomial algorithm for every fixed constant value of $|B|$, extending our previous results for $|B|\leq 2$. For arbitrary target sets, we present a $2$-approximation algorithm, an additive $(|B|-1)$-approximation algorithm, and show that the additive algorithm also yields a $3$-approximation. We also propose parameterized algorithms, including algorithms parameterized by the maximum value in the input set together with the optimum distance, and by the maximum value in the target set together with $|B|$. In addition, we propose an integer linear programming formulation that gives an exact mathematical model for the problem, analyze its size, and show that the LP relaxation has integrality gap at least $\frac{4}{3}$. Finally, we report computational experiments comparing the $2$-approximation algorithm, beam search, and simulated annealing. The results show that the approximation algorithm is highly effective in practice and often outperforms the heuristic baselines.

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

↑