Chapter 1

Chpater 1 - Intro: Some Representative Problems First the chapter provides an example of the problem and highlights the crucial issues of the problem that would need to be specifically solved in an algorithm. Next it goes into the engagement problem, explaining each element of the problem, such as the initial state, defining stability and perfect matching, and analysing the algorithm once finished. Next the chapter goes over five basic representative problems that often appear in algorithm analysis (interval scheduling, weighted interval scheduling, bipartitematching, independent set, and competitive facility location). In each subsection about the specific type of problem the book explains the importance of each analysis and how they all differ from each other.