arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.07882cs.DScs.LGmath.COmath.OC
收藏

NP难等基数划分优化的二次时间局部最优算法

A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization

Kaan Gokcesu, Hakan Gokcesu

摘要:

我们研究了等基数集划分问题的优化版本(其中等大小划分的和之间的绝对差最小化)。虽然这个问题是NP难的,一般需要指数复杂性来解决,但我们已经制定了这个NP难问题的一个较弱版本,目标是找到局部最优解。在我们的工作中考虑的局部最优性是在任何交换之间的对立分区的元素对。为此,我们设计了一个算法,可以产生这样的局部最优解在$O(N^2)$时间和$O(N)$空间。我们的方法不需要正的或整数的输入,并在任意输入精度下同样有效。因此,它广泛适用于不同的问题场景。

英文摘要:

We study the optimization version of the equal cardinality set partition problem (where the absolute difference between the equal sized partitions' sums are minimized). While this problem is NP-hard and requires exponential complexity to solve in general, we have formulated a weaker version of this NP-hard problem, where the goal is to find a locally optimal solution. The local optimality considered in our work is under any swap between the opposing partitions' element pairs. To this end, we designed an algorithm which can produce such a locally optimal solution in $O(N^2)$ time and $O(N)$ space. Our approach does not require positive or integer inputs and works equally well under arbitrary input precisions. Thus, it is widely applicable in different problem scenarios.

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

↑