Review Topics

Chapter One

• Know the definition of:
  • The stable matching problem
  • stability
  • matching
  • perfect matching
  • stable matching
  • valid partner
• Know the Gale-Shapley algorithm
• Know the main important ideas used to prove important properties of the Gale-Shapley algorithm:
  • that it always produces a stable matching
  • that it is O(n²)
  • that it matches each man with his best valid partner

Chapter Four

• Know the same kinds of definitions and ideas connected with these problems:
  • The Interval Scheduling Problem
  • The Scheduling All Intervals Problem
  • The Scheduling to Minimize Lateness Problem