Minimum-weight perfect matching for non-intrinsic distances on the line
dc.contributor.author | Delon, Julie
HAL ID: 6864 | |
dc.contributor.author | Salomon, Julien
HAL ID: 738224 | |
dc.contributor.author | Sobolevski, Andrei | |
dc.date.accessioned | 2011-02-14T13:38:33Z | |
dc.date.available | 2011-02-14T13:38:33Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/5706 | |
dc.language.iso | en | en |
dc.subject | matching | en |
dc.subject | graph | en |
dc.subject | metric space | en |
dc.subject.ddc | 519 | en |
dc.title | Minimum-weight perfect matching for non-intrinsic distances on the line | en |
dc.type | Article accepté pour publication ou publié | |
dc.contributor.editoruniversityother | Laboratoire J.-V. Poncelet (LIFR-MI2P) CNRS : UMI2615 – Independent University of Moscow;Russie | |
dc.contributor.editoruniversityother | A.A.Kharkevich Institute for Information Transmission Problems Russian Academy of Science;Russie | |
dc.contributor.editoruniversityother | Laboratoire traitement et communication de l'information (LTCI) CNRS : UMR5141 – Institut Télécom – Télécom ParisTech;France | |
dc.description.abstracten | 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. | en |
dc.relation.isversionofjnlname | Journal of Mathematical sciences | |
dc.relation.isversionofjnlvol | 181 | |
dc.relation.isversionofjnlissue | 6 | |
dc.relation.isversionofjnldate | 2012 | |
dc.relation.isversionofjnlpages | 782-791 | |
dc.relation.isversionofdoi | http://dx.doi.org/10.1007/s10958-012-0714-6 | |
dc.identifier.urlsite | http://hal.archives-ouvertes.fr/hal-00564173/fr/ | en |
dc.description.sponsorshipprivate | oui | en |
dc.relation.isversionofjnlpublisher | Springer | |
dc.subject.ddclabel | Probabilités et mathématiques appliquées | en |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |