寻找尺度上的近优独立集
Finding Near-Optimal Independent Sets at Scale
摘要:
独立集问题是NP难的,特别是在大型稀疏图中很难解决。在这项工作中,我们开发了一种先进的进化算法,它采用核化技术来计算大型稀疏网络中的大型独立集。最近的一个精确算法表明,大型网络可以通过采用分支和减少技术来精确求解,该技术递归地将图核化并执行分支。然而,他们的算法的一个主要缺点是,对于巨大的图,分支仍然需要指数时间。为了避免这个问题,我们递归地选择可能在一个大的独立集中的顶点(使用进化方法),然后进一步核化图。我们发现,识别和删除可能是在大型独立集的顶点打开了减少空间-这不仅大大加快了大型独立集的计算,但也使我们能够计算高质量的独立集上更大的实例比以前在文献中报道。
英文摘要:
The independent set problem is NP-hard and particularly difficult to solve in large sparse graphs. In this work, we develop an advanced evolutionary algorithm, which incorporates kernelization techniques to compute large independent sets in huge sparse networks. A recent exact algorithm has shown that large networks can be solved exactly by employing a branch-and-reduce technique that recursively kernelizes the graph and performs branching. However, one major drawback of their algorithm is that, for huge graphs, branching still can take exponential time. To avoid this problem, we recursively choose vertices that are likely to be in a large independent set (using an evolutionary approach), then further kernelize the graph. We show that identifying and removing vertices likely to be in large independent sets opens up the reduction space---which not only speeds up the computation of large independent sets drastically, but also enables us to compute high-quality independent sets on much larger instances than previously reported in the literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。