Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver

Matthias F. Stallmann, Yang Ho, Timothy D. Goodrich

Akiba and Iwata [TCS, 2016] demonstrated that a branch and reduce (B&R) solver for the vertex cover problem can compete favorably with integer linear programming solvers (e.g., CPL…