Minimum—weight perfect matching for nonintrinsic distances on the line
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. Bibliography: 11 titles.
KeywordsPerfect Match Recursion Relation Match Problem Perfect Match Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media, Inc. 2012