abstract:In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is polynomial in the numeric value of the input (which is exponential in the length of the input – its number of digits).
Forno-waited model, we showitisstronglyNP-hard, and present a pseudo-polynomialtime optimal algorithmandanapproximation algorithm with worst-case ratio 5/3.