 |
|
|
|
| HAL : hal-00564173, version 2 |
| arXiv : 1102.1558 |
| Fiche détaillée |  Récupérer au format |
|
|
| Versions disponibles : | v1 (08-02-2011) | v2 (26-03-2011) |
|
|
|
|
| Minimum-weight perfect matching for non-intrinsic distances on the line |
|
|
| Julie Delon 1Julien Salomon 2 |
|
|
| (26/03/2011) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire traitement et communication de l'information (LTCI) |
|
|
|
CNRS : UMR5141 – Institut Télécom – Télécom ParisTech |
|
|
| 2 : | CEntre de REcherches en MAthématiques de la DEcision (CEREMADE) |
|
|
|
CNRS : UMR7534 – Université Paris IX - Paris Dauphine |
|
|
| 3 : | Laboratoire J.-V. Poncelet (LIFR-MI2P) |
|
|
|
CNRS : UMI2615 – Independent University of Moscow |
|
|
| 4 : | A.A.Kharkevich Institute for Information Transmission Problems |
|
|
|
Russian Academy of Science |
|
|
|
|
|
|
|
|
|
| Domaine | : | Mathématiques/Optimisation et contrôle |
|
|
| matching – graph – metric space |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00564173, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00564173 | |
| oai:hal.archives-ouvertes.fr:hal-00564173 | |
| Contributeur : Andrei Sobolevskii | |
| Soumis le : Samedi 26 Mars 2011, 16:06:56 | |
| Dernière modification le : Samedi 26 Mars 2011, 21:20:17 | |
