Before revision:  Second, we prove thatgiven a rational measure, an optimal transport to a set of measures can be computed in polynomial time .
After revision:  Containment of SCMP in NP will remain open. We prove that, for a given measure, sparsity and cost of an optimal transport to a set of measures can be computed in polynomial time .