If an algorithm "A" guarantees to return solutions with a performance guarantee of at most "r"("n"), then "A" is said to be an "r"("n")-approximation algorithm and has an "approximation ratio" of "r"("n").