Skip to main content
Springer Nature Link
Log in

An \(O(n^2)\) Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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 via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Ben-Dor, A., Karp, R.M., Schwikowski, B., Shamir, R.: The restriction scaffold problem. J. Comput. Biol. 10, 385–398 (2003)

    Article  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. 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)

  4. 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)

    Article  MathSciNet  MATH  Google Scholar 

  5. Colannino, J., Toussaint, G.: An algorithm for computing the restriction scaffold assignment problem in computational biology. Inf. Process. Lett. 95(4), 466–471 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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)

  7. Eiter, T., Mannila, H.: Distance measures for point sets and their computation. Acta Inform. 34, 109–133 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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)

    Article  MATH  Google Scholar 

  9. Karp, R.M., Li, S.-Y.R.: Two special cases of the assignment problem. Discrete Math. 13(46), 129–142 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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)

  11. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics. vol. 24. Springer, Berlin (2003)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Islamic Azad University, North Tehran Branch, Tehran, Iran

    Fatemeh Rajabi-Alni

  2. Department of Computer Engineering and IT, Amirkabir University of Technology, Tehran, Iran

    Alireza Bagheri

Authors
  1. Fatemeh Rajabi-Alni
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Alireza Bagheri
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Fatemeh Rajabi-Alni.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-015-0044-4

Keywords