We present a new FPTAS for the Subset Sum Ratio problem, which, given a set\nof integers, asks for two disjoint subsets such that the ratio of their sums is\nas close to $1$ as possible. Our scheme makes use of exact and approximate\nalgorithms for the closely related Partition problem, hence any progress over\nthose -- such as the recent improvement due to Bringmann and Nakos [SODA 2021]\n-- carries over to our FPTAS. Depending on the relationship between the size of\nthe input set $n$ and the error margin $\\varepsilon$, we improve upon the best\ncurrently known algorithm of Melissinos and Pagourtzis [COCOON 2018] of\ncomplexity $O(n^4 / \\varepsilon)$. In particular, the exponent of $n$ in our\nproposed scheme may decrease down to $2$, depending on the Partition algorithm\nused. Furthermore, while the aforementioned state of the art complexity,\nexpressed in the form $O((n + 1 / \\varepsilon)^c)$, has constant $c = 5$, our\nresults establish that $c < 5$.\n