Revision as of 14:48, 30 April 2025 edit Klbrain (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers 97,799 edits Closing stale March merge proposal; uncontested objection and no support; see Talk:Linear bottleneck assignment problem#Merge proposal ← Previous edit		Revision as of 09:53, 9 May 2025 edit undo PeterBirchler (talk \| contribs) 7 edits The link to the study was an unsecured link. I’ve replaced it with a working link Next edit →
Line 86: === Other methods and approximation algorithms=== Other approaches for the assignment problem exist and are reviewed by Duan and Pettie<ref>{{Cite journal\|last1=Duan\|first1=Ran\|last2=Pettie\|first2=Seth\|date=2014-01-01\|title=Linear-Time Approximation for Maximum Weight Matching\|url= https://~~web~~dl.~~eecs~~acm.~~umich.edu~~org/~~~pettie~~doi/~~papers~~10.1145/~~ApproxMWM-JACM.pdf~~2529989 \|journal=Journal of the ACM\|volume=61\|pages=1–23\|language=EN\|doi=10.1145/2529989\|s2cid=207208641}}</ref> (see Table II). Their work proposes an [[approximation algorithm]] for the assignment problem (and the more general [[maximum weight matching]] problem), which runs in linear time for any fixed error bound. == Many-to-many assignment{{Anchor\|mtm}} ==

Assignment problem: Difference between revisions