Given two point sets S and T, in a many-to-many matching between S and T each point in S is assigned to one or more points in T and vice versa. A generalization of the many-to-many matching problem is the limited capacity many-to-many matching problem, where the number of points that can be matched to each point (the capacity of each point) is limited. In this paper, we provide an \(O\left( n^2\right) \) time algorithm for the one dimensional minimum-cost limited capacity many-to-many matching problem, where \(\left| S\right| +\left| T\right| =n\). Our algorithm improves the best previous time complexity of \(O(kn^2)\), that in which k is the largest capacity of the points in \(S \cup T\). In this problem, both S and T lie on the real line and the cost of matching \(s \in S\) to \(t \in T\) is equal to the distance between s and t.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Ben-Dor, A., Karp, R.M., Schwikowski, B., Shamir, R.: The restriction scaffold problem. J. Comput. Biol. 10, 385–398 (2003)
Burkard, R.E., Cela, E.: Linear assignment problems and extensions. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization (Supplement Volume A) (Volume 4), pp. 75–149. Kluwer Academic Publishers, Dordrecht (1999)
Buss, S.R., Yianilos, P.N.: A bipartite matching approach to approximate string comparison and search. Technical report, NEC Research Institute, Princeton, New Jersey (1995)
Colannino, J., Damian, M., Hurtado, F., Langerman, S., Meijer, H., Ramaswami, S., Souvaine, D., Toussaint, G.: Efficient many-to-many point matching in one dimension. Graphs Comb. 23, 169–178 (2007)
Colannino, J., Toussaint, G.: An algorithm for computing the restriction scaffold assignment problem in computational biology. Inf. Process. Lett. 95(4), 466–471 (2005)
Colannino, J., Toussaint, G.: Faster algorithms for computing distances between one-dimensional point sets. In: Santos F., Orden D. (eds.) Proceedings of XI Encuentros de Geometria Computacional, pp. 189–198 (2005)
Eiter, T., Mannila, H.: Distance measures for point sets and their computation. Acta Inform. 34, 109–133 (1997)
Demirci, M.F., Shokoufandeh, A., Keselman, Y., Bretzner, L., Dickinson, S.: Object recognition as many-to-many feature matching. Int. J. Comput. Vis. 69, 203–222 (2006)
Karp, R.M., Li, S.-Y.R.: Two special cases of the assignment problem. Discrete Math. 13(46), 129–142 (1975)
Panahi, F., Mohades, A.: Computing minimum limited-capacity matching in one-dimensional space and for the points lying on two perpendicular lines. In: Proceedings of 22nd annual Canadian conference on computational geometry, pp. 237–240 (2010)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics. vol. 24. Springer, Berlin (2003)
About this article
Cite this article
Rajabi-Alni, F., Bagheri, A. An \(O(n^2)\) Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension. Algorithmica 76, 381–400 (2016). https://doi.org/10.1007/s00453-015-0044-4
- Many-to-many point matching
- One dimensional point-matching
- Limited capacity point matching