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 .
Given two point sets S and T on a line, we present the first linear time algorithm for finding the limited capacity many-to-many matching (LCMM) between S and T improving the previous best known quadratic time algorithm. The aim of the LCMM is to match each point of S (T) to at least one point of T (S) such that the matching costs is minimized and the number of the points matched to each point is limited to a given number .
R
a
the first
A
finding
A
(LCMM)
R
which improves the previous quadratic algorithm
improving the previous best known quadratic time algorithm. The aim of the LCMM is to match each point of S (T) to at least one point of T (S) such that the matching costs is minimized and the number of the points matched to each point is limited to a given number