Before revision:  The authors prove that the considered problems are ordinary NP hard and provide pseudo polynomial time Dynamic Programming (DP) solutions.
After revision:  They also prove that the considered problems are ordinary NP hard and provide pseudo polynomial time Dynamic Programming (DP) solutions.