Show simple item record

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

dc.contributor.authorDelon, Julie
HAL ID: 6864
dc.contributor.authorSalomon, Julien
HAL ID: 738224
dc.contributor.authorSobolevski, Andrei
dc.date.accessioned2011-02-14T13:38:33Z
dc.date.available2011-02-14T13:38:33Z
dc.date.issued2012
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5706
dc.language.isoenen
dc.subjectmatchingen
dc.subjectgraphen
dc.subjectmetric spaceen
dc.subject.ddc519en
dc.titleMinimum-weight perfect matching for non-intrinsic distances on the lineen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherLaboratoire J.-V. Poncelet (LIFR-MI2P) CNRS : UMI2615 – Independent University of Moscow;Russie
dc.contributor.editoruniversityotherA.A.Kharkevich Institute for Information Transmission Problems Russian Academy of Science;Russie
dc.contributor.editoruniversityotherLaboratoire traitement et communication de l'information (LTCI) CNRS : UMR5141 – Institut Télécom – Télécom ParisTech;France
dc.description.abstractenWe 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.isversionofjnlnameJournal of Mathematical sciences
dc.relation.isversionofjnlvol181
dc.relation.isversionofjnlissue6
dc.relation.isversionofjnldate2012
dc.relation.isversionofjnlpages782-791
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/s10958-012-0714-6
dc.identifier.urlsitehttp://hal.archives-ouvertes.fr/hal-00564173/fr/en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherSpringer
dc.subject.ddclabelProbabilités et mathématiques appliquéesen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record