Minimum-weight perfect matching for nonintrinsic distances on the line

DOI10.1007/s10958-012-0714-6zbMath1254.05154arXiv1102.1558OpenAlexW2043732304MaRDI QIDQ1762537

Andrei N. Sobolevskiĭ, Julien Salomon, Julie Delon

Publication date: 27 November 2012

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.1558

zbMATH Keywords

bottom-up recursion relationminimum-weight perfect matching problem on the linepartial minimum-weight matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Uses Software

• Blossom IV

Cites Work

• Unnamed Item
• Local matching indicators for concave transport costs
• Two special cases of the assignment problem
• Lectures on analysis on metric spaces
• Local Matching Indicators for Transport Problems with Concave Costs
• Bipartite graph matching for points on a line or a circle
• Exact solutions to the transportation problem on the line
• Computing Minimum-Weight Perfect Matchings
• Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Minimum-weight perfect matching for nonintrinsic distances on the line