AD-L43-NPC-Hamiltonian-Cycle.pdf

AD-L44-NPC-3Coloring.pdf

AD-L45-Pseudo-Polynomial-Time.pdf

AD-L46-Parameterized-Complexity.pdf

AD-L47-Branch-and-Bound.pdf

AD-L48-Lowering-Worst-Case-Complexity.pdf

AD-L49-Local-Search.pdf

AD-L50-Variable-Depth-Local-Search.pdf

AD-L51-Local-Search-Quality-Complexity.pdf

AD-L52-Approximation-Algorithms.pdf

AD-L53-Approximation-Makespan-Scheduling-Problem.pdf