2 papers
cs.DS2026
Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
Jialiang Li, Aneta Neumann, Frank Neumann +2
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algor…
cs.LG2025
Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization
Jialiang Li, Weitong Chen, Mingyu Guo
Neural models have shown promise in solving NP-hard graph combinatorial optimization (CO) problems. Once trained, they offer fast inference and reasonably high-quality solutions fo…