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

https://hal.archives-ouvertes.fr/hal-00564173
Contributor : Andrei Sobolevskii <>
Submitted on : Tuesday, February 8, 2011 - 10:57:03 AM
Last modification on : Friday, September 18, 2020 - 10:50:04 AM
Long-term archiving on: : Monday, May 9, 2011 - 3:04:48 AM

Files

JSSrecursion.pdf
Files produced by the author(s)

Identifiers

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

Citation

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

Share

Metrics

Record views

22

Files downloads

15