Before revision: Given two point sets S and T on a line, we present a linear time algorithm for  the limited capacity many-to-many matching  between S and T which improves the previous quadratic algorithm .
After revision: Given two point sets S and T on a line, we present a linear time algorithm for finding the limited capacity many-to-many matching between S and T which improves the previous quadratic algorithm .