Skip to site navigation

Skip to content

 
  • Reading: Chapter 6
  • Lecture note: part 01 (March 26), part 02 (April 2)
  • Practice problem set:
    • 6.01 (Hint: See the hint from the text book.)
    • 6.08 (Hint: Use a matrix and compute k)
    • 6.12 (Hint: See the hint from the text book. Consider all possible ways to add two diagonals to a sub-polygon.)
    • 6.17 (Hint: Knapsack)
    • 6.21 (Hint: Vertex coverage of the parent node is obtained from the vertex coverage of its children.)

Back to top of content

Back to the very top