A Generalized Hypergreedy Algorithm for Weighted Perfect Matching

We give a generalization of the hypergreedy algorithm for minimum weight perfect matching on a complete edge weighted graph whose weights satisfy the triangle inequality