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

并行结构上离散优化问题的核化

Kernelization of Discrete Optimization Problems on Parallel Architectures

Bolarinwa Olayemi Saheed

摘要:

存在用于处理离散优化问题的现有标准求解器。然而,在实践中,它是罕见的直接应用到大输入空间的典型这类问题。相反,输入被预处理以寻找简化并提取问题空间的核心子集,称为内核。这个预处理过程在参数化复杂性理论的上下文中被称为核化。在这篇论文中,我实现了一些核化算法的并行版本,并评估了它们的性能。核化算法的性能通过输出核的大小或计算核所需的时间来衡量。有时内核与原始输入相同,因此希望尽快了解这一点。问题的范围被限制到一个特定类型的离散优化问题,这是一个版本的K-团的问题,其中给定的图形的节点是预先着色合法使用k种颜色。最后的评估表明,我的并行实现实现至少有一个这些算法的效率提高了50%以上。这不仅是在速度方面实现的,而且还能够产生更小的内核。

英文摘要:

There are existing standard solvers for tackling discrete optimization problems. However, in practice, it is uncommon to apply them directly to the large input space typical of this class of problems. Rather, the input is preprocessed to look for simplifications and to extract the core subset of the problem space, which is called the Kernel. This pre-processing procedure is known in the context of parameterized complexity theory as Kernelization. In this thesis, I implement parallel versions of some Kernelization algorithms and evaluate their performance. The performance of Kernelization algorithms is measured either by the size of the output Kernel or by the time it takes to compute the kernel. Sometimes the Kernel is the same as the original input, so it is desirable to know this, as soon as possible. The problem scope is limited to a particular type of discrete optimisation problem which is a version of the K-clique problem in which nodes of the given graph are pre-coloured legally using k colours. The final evaluation shows that my parallel implementations achieve over 50% improvement in efficiency for at least one of these algorithms. This is attained not just in terms of speed, but it is also able to produce a smaller kernel.

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

↑