arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.13645cs.DS
收藏

大规模求解近最优带权独立集

Finding Near-Optimal Weight Independent Sets at Scale

Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash

AI总结:

针对大规模稀疏图中最大带权独立集求解难题,提出结合数据归约的模因算法,递归选取高概率高权顶点并归约图,在207个实例中205个取得最佳结果。

摘要:

在图中计算最大带权独立集是一个重要的 NP 难优化问题。该问题在大型图上尤其难以求解,因为数据归约技术在这些图上效果不佳。更具体地说,如果归约可用,最先进的分支归约算法能够求解许多大规模图;否则,由于分支需要指数时间,其性能会迅速下降。本文开发了一种先进的 memetic(模因)算法来处理该问题,该算法结合了最新的数据归约技术,以在巨大的稀疏网络中计算近最优的带权独立集。更准确地说,我们使用模因方法递归选择可能位于高权独立集中的顶点,将这些顶点加入解中,并进一步归约图。我们表明,识别并移除可能位于高权独立集中的顶点会打开归约空间,并显著加快高权独立集的计算。实验评估表明,我们能够优于最先进的算法。例如,我们的两种算法配置在 207 个实例中的 205 个上计算出所有竞争算法中的最佳结果。因此,当实际中需要计算高权独立集时,该方法可被视为一种有用的工具。

英文摘要:

Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large graphs for which data reduction techniques do not work well. To be more precise, state-of-the-art branch-and-reduce algorithms can solve many large-scale graphs if reductions are applicable. Otherwise, their performance quickly degrades due to branching requiring exponential time. In this paper, we develop an advanced memetic algorithm to tackle the problem, which incorporates recent data reduction techniques to compute near-optimal weighted independent sets in huge sparse networks. More precisely, we use a memetic approach to recursively choose vertices that are likely to be in a large-weight independent set. We include these vertices into the solution, and further reduce the graph. We show that identifying and removing vertices likely to be in large-weight independent sets opens up the reduction space and speeds up the computation of large-weight independent sets remarkably. Our experimental evaluation indicates that we are able to outperform state-of-the-art algorithms. For example, our two algorithm configurations compute the best results among all competing algorithms for 205 out of 207 instances. Thus can be seen as a useful tool when large-weight independent sets need to be computed in~practice.

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

↑