Journal ArticleOPEN ACCESS

Minimum-weight perfect matching for nonintrinsic distances on the line

Journal of Mathematical Sciences (2012) 181(6) 782-791
DOI: 10.1007/s10958-012-0714-6
2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Your institution provides access to this article.

Abstract

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. © 2012 Springer Science+Business Media, Inc.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free