最大权重独立集问题的数据约简规则综述
A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem
AI总结:
本文针对NP难的最大权重独立集问题,全面综述其各类多项式时间数据约简规则,提供规则参考实现并将持续更新,为相关研究者和从业者提供集中参考资源。
摘要:
最大权重独立集(MWIS)问题及其相关问题(如最小权重顶点覆盖)是具有大量实际应用的基础NP难问题。由于这类问题的计算复杂度较高,近年来研究者提出了多种数据约简规则来简化问题实例,从而让精确求解器和启发式方法能够更高效地处理这类问题。数据约简规则是一类多项式时间流程,可在对实例进行约简的同时保证:约简后实例上的最优解可以轻松扩展为原始实例的最优解。数据约简规则已被证实在分支约简方法中尤为实用,成功的约简往往能得到可被精确求解的问题实例。本综述全面梳理了面向MWIS问题的数据约简规则,同时提供了这些约简规则的参考实现。本综述会随着新约简技术的发展持续更新,为研究人员和从业者提供集中化的参考资源。
英文摘要:
The Maximum Weight Independent Set (MWIS) problem, as well as its related problems such as Minimum Weight Vertex Cover, are fundamental NP-hard problems with numerous practical applications. Due to their computational complexity, a variety of data reduction rules have been proposed in recent years to simplify instances of these problems, enabling exact solvers and heuristics to handle them more effectively. Data reduction rules are polynomial time procedures that can reduce an instance while ensuring that an optimal solution on the reduced instance can be easily extended to an optimal solution for the original instance. Data reduction rules have proven to be especially useful in branch-and-reduce methods, where successful reductions often lead to problem instances that can be solved exactly. This survey provides a comprehensive overview of data reduction rules for the MWIS problem. We also provide a reference implementation for these reductions. This survey will be updated as new reduction techniques are developed, serving as a centralized resource for researchers and practitioners.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。