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 application/pdf 699 KB Download File

Also Published In

BIT. Numerical mathematics

More About This Work

Academic Units
Biomedical Informatics
Published Here
September 29, 2014