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.