Before revision:  We propose an O(n^2) time algorithm for computing a one-dimensional MMD (OMMD) of minimum cost  where |S|+|T| = n. In an OMMD  the input point sets S and T lie on the  line and the cost of matching a point to another point is equal to the distance between the two points.
After revision:  We propose an O(n^2) time algorithm for computing a one-dimensional MMD (OMMD) of minimum cost where |S|+|T| = n. In an OMMD problem, the input point sets S and T lie on the line and the cost of matching a point to another point is equal to the distance between the two points.