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

14 Mar 2020 Stallmann Matthias F. Ho Yang Goodrich Timothy D.

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., CPLEX). Our research question is are there graph characteristics that determine which reductions will be most effective?.. (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS