Academic Commons


A Generalized Hypergreedy Algorithm for Weighted Perfect Matching

Imielinska, Celina Z.; Kalantari, Bahman

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.


  • thumnail for 1993_Imielinska_BIT_Kalantari.pdf 1993_Imielinska_BIT_Kalantari.pdf text/pdf 699 KB Download File

Also Published In

BIT. Numerical mathematics

More About This Work

Academic Units
Biomedical Informatics
Published Here
September 29, 2014
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.