@lox As for what the term means, I couldn't really place it. It could be a variant of (or alternative name for?) the complexity class of problems that admit a PTAS, also called PTAS. Can you mention the context in which you encountered the term?
@Discretelizard I found it in literature. The "power" means asymptotic PTAS. So if algorithm A is PTAS^k for a problem, then it is bounded from above by (1+epsilon)*OPT + k (assuming its a minimization problem). Thanks for your reply.
