Are there FPTASs for the min cost flow problem? In literature, one can find many approximation algorithms for the multicommodity min cost flow problem or other variants of the standard single-commodity min cost flow problem. But are there FPTASs for the min cost flow problem?

Possibly, there is no need for an FPTAS here since an optimal solution can be computed very fast (using double scaling or the enhanced capacity scaling algorithm, for example). But from a theoretical point of view, this would be interesting to know.
If an optimal solution can be calculated in polynomial time, then the same algorithm gives you an FPTAS.

There might, however, be quasilinear time algorithms which give better and better approximations, running faster than algorithms for computing the min cost flow exactly.