title: What is an algorithm to split a group of items into 3 separate groups fairly?
body: <p>I have this problem in my textbook: 
  Given a group of n items, each with a distinct value V(i), what is the best way to divide the items into 3 groups so the group with the highest value is minimIzed? Give the value of this largest group.</p>
  
  <p>I know how to do the 2 pile variant of this problem: it just requires running the knapsack algorithm backwards on the problem. However, I am pretty puzzled as how to solve this problem. Could anyone give me any pointers?</p>
  
  <p>Answer: Pretty much the same thing as the 0-1 knapsack, although 2D</p>