A Faster Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension

Abstract

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.Comment: 18 pages, 7 figures. arXiv admin note: text overlap with arXiv:1702.0108