Before revision:  This is the best possible in polynomial time  unless P = NP. All these results hold for both of the discrete versions  .
After revision:  This is the best possible in polynomial time unless P = NP. All these results hold for both of the discrete versions as well as the continuous version; in fact, the NP-hardness and approximation results also hold under the Wasserstein distance for the continuous version .