1 citations · 1 across the 6 of their papers we have counts for
1 paper · 1 filter
Andres Pastrana-Cruz, Manuel Lafond
Several NP-hard problems are solved exactly using exponential-time branching strategies, whether it be branch-and-bound algorithms, or bounded search trees in fixed-parameter algor…