arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.05180cs.DScs.AIcs.IR
收藏

基于递增变换的最大权独立集问题的数据约简

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院);University of Vienna(维也纳大学);Hamilton College(汉密尔顿学院);Alfréd Rényi Institute of Mathematics(阿尔弗雷德·雷尼数学研究所)

Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij

摘要:

给定一个顶点加权图,最大权独立集问题要求一个两两不相邻的顶点集,使得它们的权之和最大。分支归约范式是实际中解决问题最优性的事实标准方法。在这个范例中,数据简化规则被应用于减少问题的大小。这些数据简化规则确保在新的(较小的)输入上给出最优解,可以在原始输入上快速构造最优解。我们引入新的广义数据减少和转换规则的问题。我们的工作的一个关键特征是,一些转换规则可以增加输入的大小。令人惊讶的是,这些所谓的递增变换可以简化问题,并打开约简空间,在整个算法中产生更小的不可约图。在实验中,我们的算法计算显着更小的不可约图,除了一个实例,解决更多的实例比以前可能的最优性,是两个数量级的速度比最好的最先进的求解器,并发现更高质量的解决方案比启发式求解器DynWVC和HILS在许多情况下。虽然越来越多的转换在这个时候只足够有效地进行预处理,但我们认为这是迈向新的分支和转换范式的关键第一步。

英文摘要:

Given a vertex-weighted graph, the maximum weight independent set problem asks for a pair-wise non-adjacent set of vertices such that the sum of their weights is maximum. The branch-and-reduce paradigm is the de facto standard approach to solve the problem to optimality in practice. In this paradigm, data reduction rules are applied to decrease the problem size. These data reduction rules ensure that given an optimum solution on the new (smaller) input, one can quickly construct an optimum solution on the original input. We introduce new generalized data reduction and transformation rules for the problem. A key feature of our work is that some transformation rules can increase the size of the input. Surprisingly, these so-called increasing transformations can simplify the problem and also open up the reduction space to yield even smaller irreducible graphs later throughout the algorithm. In experiments, our algorithm computes significantly smaller irreducible graphs on all except one instance, solves more instances to optimality than previously possible, is up to two orders of magnitude faster than the best state-of-the-art solver, and finds higher-quality solutions than heuristic solvers DynWVC and HILS on many instances. While the increasing transformations are only efficient enough for preprocessing at this time, we see this as a critical initial step towards a new branch-and-transform paradigm.

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

↑