1993 Articles
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.
Subjects
Files
- 1993_Imielinska_BIT_Kalantari.pdf application/pdf 699 KB Download File
Also Published In
- Title
- BIT. Numerical mathematics
More About This Work
- Academic Units
- Biomedical Informatics
- Published Here
- September 29, 2014