← 研踪 PaperTrailarXiv:2611.24211 · v1
Expand & Reduce: a Framework Bridging Branch-and-Reduce and Dynamic Programming
首次提交 2026-11-18 18:49
版本更新 2026-11-18 18:49
雷达观测 2026-11-19 15:04
摘要
We introduce expand-and-reduce, a framework that augments classical reduction rules with a new type of optimality-preserving operation, called an expansion rule. While a reduction rule in practice typically makes the instance smaller, an expansion rule may enlarge the instance yet still making progress towards a solution. We present a simple expansion rule called edge expansion for the Maximum Weighted Independent Set (MWIS) problem. It encodes the joint choice of two non-adjacent vertices by adding an edge between them and creating a new vertex representing their union. We prove that the number of edge expansions needed to transform a graph into a clique equals the number of independent sets in the graph minus the number of vertices. We demonstrate that expand-and-reduce, using edge expansion and just two well-known reduction rules, has greater reduction power than a set of 22 commonly used reduction rules for MWIS. Therefore, it can significantly simplify methods that depend on reduction rules. To highlight the practical potential of the expand-and-reduce framework further, we provide an implementation and preliminary results showing that a simple implementation outperforms a far more advanced method for MWIS preprocessing. Moreover, expand-and-reduce can simulate both branching and dynamic-programming-style state construction, yielding exact and fixed-parameter algorithms with matching asymptotic running times. By that, expand-and-reduce offers a unified and conceptually clean perspective on techniques that are usually considered incompatible.
作者备注:18 pages, 5 figures. Code and data links included in paper
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 18:49 · 最新观测版本
Expand & Reduce: a Framework Bridging Branch-and-Reduce and Dynamic Programming
We introduce expand-and-reduce, a framework that augments classical reduction rules with a new type of optimality-preserving operation, called an expansion rule. While a reduction rule in practice typically makes the instance smaller, an expansion rule may enlarge the instance yet still making progress towards a solution. We present a simple expansion rule called edge expansion for the Maximum Weighted Independent Set (MWIS) problem. It encodes the joint choice of two non-adjacent vertices by adding an edge between them and creating a new vertex representing their union. We prove that the number of edge expansions needed to transform a graph into a clique equals the number of independent sets in the graph minus the number of vertices. We demonstrate that expand-and-reduce, using edge expansion and just two well-known reduction rules, has greater reduction power than a set of 22 commonly used reduction rules for MWIS. Therefore, it can significantly simplify methods that depend on reduction rules. To highlight the practical potential of the expand-and-reduce framework further, we provide an implementation and preliminary results showing that a simple implementation outperforms a far more advanced method for MWIS preprocessing. Moreover, expand-and-reduce can simulate both branching and dynamic-programming-style state construction, yielding exact and fixed-parameter algorithms with matching asymptotic running times. By that, expand-and-reduce offers a unified and conceptually clean perspective on techniques that are usually considered incompatible.
查看此版本解读 →查看此版本原文 ↗