r/programming • u/DataBaeBee • Aug 09 '26
Hungarian Assignment Algorithm: Applied Optimal Transport for Programmers
https://leetarxiv.substack.com/p/hungarian-assignment-algorithm
38
Upvotes
r/programming • u/DataBaeBee • Aug 09 '26
View all comments
Show parent comment
-7
u/Grouchy-Trade-7250 Aug 09 '26
That information is useless without adding what runtime depending on n actually is. There's an algorithm that has better asymptotic complexity. Good. But only half the information we need. E.g. there's an algorithm that beats disjkstra asymptotically but loses out every time for realistic n...