We are trying the find the unique sparest solution to the P0 problem
One thing that we are sure about is that we do not want to use the Exhaustive Search way to solve this problem
Because finding the exact solution by the exhaustive search will cost so much, we choose to use some approximation algorithms: Greedy algorithms or Relaxation algorithms
