Skip to main content
SpringerLink
Log in

Minimum—weight perfect matching for nonintrinsic distances on the line

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We consider a minimum-weight perfect matching problem on the line and establish a “bottom-up” recursion relation for weights of partial minimum-weight matchings. Bibliography: 11 titles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Aggarwal, A. Bar-Noy, S. Khuller, D. Kravets, and B. Schieber, “Efficient minimum cost matching using quadrangle inequality,” J. Algorithms, 19, No. 1, 116-143 (1995).

    Article  MathSciNet  MATH  Google Scholar 

  2. D. Burago, Y. Burago, and S. Ivanov, A Course in Metric Geometry, Amer. Math. Soc., Providence, Rhode Island (2001).

    MATH  Google Scholar 

  3. W. Cook and A. Rohe, “Computing minimum-weight perfect matching,” INFORMS J. Comput., 11, No. 2, 138-148 (1999).

    Article  MathSciNet  MATH  Google Scholar 

  4. J. Delon, J. Salomon, and A. Sobolevski, “Local matching indicators for concave transport costs,” C. R. Acad. Sci. Paris Sér. I Math., 348, No. 15-16, 901-905 (2010).

    Article  MATH  Google Scholar 

  5. J. Delon, J. Salomon, and A. Sobolevski, “Local matching indicators for transport problems with concave costs,” in preparation.

  6. J. Edmonds, “Maximum matching and a polyhedron with 0,1-vertices,” J. Res. Nat. Bur. Standards, 6913, 125-130 (1965).

    MathSciNet  Google Scholar 

  7. J. Edmonds, “Paths, trees and flowers,” Canad. J. Math., 17, 449-467 (1965).

    Article  MathSciNet  MATH  Google Scholar 

  8. J. Heinonen, Lectures on Analysis in Metric Spaces, Springer-Verlag, New York (2061).

    Google Scholar 

  9. R. M. Karp and S. Y. R. Li, “Two special cases of the assignment prob1em,” Discrete Math., 13, 129-142 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  10. R. J. McCann, “Exact solutions to the transportation problem on the line,” Prac. R. Sac. Lond. Ser. A Math. Phys. Eng. Sci., 455, 1341-1386 (1989).

    Article  MathSciNet  Google Scholar 

  11. M. Werman, S. Peleg, R. Melter and T. Y. Kong, “Bipartite graph matching for points on a line or a circle,” J. Algorithms, 7, No. 2, 277-284 (1986).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LTCI CNRS TELECOM ParisTech, Paris, France

    J. Delon

  2. CEREMADE, Université Paris-Dauphine, Paris, France

    J. Salomon

  3. Insnitute for Information Transmission Problems (Kharkevich Institute), Moscow, Russia

    A. Sobolevski

  4. Laboratoire J.-V. Poncelet (UMI 2615 CNRS), Moscow, Russia

    A. Sobolevski

  5. Moscow Institute for Physics and Technology (MIPT), Moscow, Russia

    A. Sobolevski

Authors
  1. J. Delon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Salomon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Sobolevski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Sobolevski.

Additional information

Published in Zapiski Nauchnykh Seminarov POMI, Vol. 390, 2011, pp. 52-68.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delon, J., Salomon, J. & Sobolevski, A. Minimum—weight perfect matching for nonintrinsic distances on the line. J Math Sci 181, 782–791 (2012). https://doi.org/10.1007/s10958-012-0714-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-012-0714-6

Keywords

Search

Navigation