Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Minimum-weight perfect matching for non-intrinsic distances on the line

Abstract : Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances along the line. This problem is closely related to one-dimensional Monge-Kantorovich trasnport optimization. The main result of the present note is a "bottom-up'' recursion relation for weights of partial minimum-weight matchings.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00564173
Contributor : Andrei Sobolevskii <>
Submitted on : Saturday, March 26, 2011 - 4:06:56 PM
Last modification on : Monday, October 12, 2020 - 6:21:01 PM
Long-term archiving on: : Monday, June 27, 2011 - 2:30:07 AM

Files

JSSrecursion2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00564173, version 2
  • ARXIV : 1102.1558

Citation

Julie Delon, Julien Salomon, Andrei Sobolevski. Minimum-weight perfect matching for non-intrinsic distances on the line. 2011. ⟨hal-00564173v2⟩

Share

Metrics

Record views

517

Files downloads

338