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.

翻译：最大加权独立集（MWIS）问题及其相关变体（如最小加权顶点覆盖问题）是基础性的NP难问题，具有广泛的实际应用。由于这些问题的计算复杂性，近年来研究者提出了多种数据约简规则来简化问题实例，从而使精确求解器和启发式算法能够更有效地处理它们。数据约简规则是多项式时间过程，能够在保证约简后实例的最优解可轻松扩展为原实例最优解的前提下缩减问题规模。数据约简规则在分支约简方法中尤为有效，成功的约简往往能产生可精确求解的问题实例。本文系统综述了MWIS问题的数据约简规则，并提供了这些约简规则的参考实现。本综述将随着新约简技术的发展持续更新，旨在为研究者和实践者提供集中化的参考资源。