3 ms·
Isn't the donor-patient problem a vertex cycle cover? Finding a minimum one is NP-complete, how exactly is this one applied? edit: found a bit more informatio
by loversinarms 11y ago
Isn't the donor-patient problem a vertex cycle cover? Finding a minimum one is NP-complete, how exactly is this one applied?
edit:
found a bit more information https://www.siam.org/news/news.php?id=1474 https://www.siam.org/news/news.php?id=1474
- marketforlemmas 11y agoYou are right that the general problem is intractable; a lot of the advances in these match making algorithms come from better heuristics and computing power.