Hello!!! I have the followinf exercise:
We have a set ofobjects, denoted
, which we want to group in clusters that consist of consecutive objects. For each cluster
, there is an associated cost
. We want to find a grouping of the objects in clusters such that the total cost is minimum. Formulate the problem as a shortest path problem, and write a DP algorithm for its solution.
Could you help me understanding this exercise? Which algorithm do I have to use?