Branching Algorithms

Week
Week 02
Description
We discuss algorithms based on depth-bounded search trees. These algorithms typically involve coming up with a recursive approach to the problem, where the depth of recursion is bounded by a function of the parameter.
Problems
VC
FVS
VC above LP
OCT
Almost-2-SAT
Module