help wanted
Repository metrics
- Stars
- (11 stars)
- PR merge metrics
- (30d に merged PR はありません)
説明
Potential approaches:
- stable marriage problem
- Gale-Shapley algorithm -
O(n^2)- Ensures "there does not exist any match
(A, B)by which bothAandBwould be individually better off than they are with the element to which they are currently matched" - "not necessarily optimal from all individuals' points of view"
- https://rosettacode.org/wiki/Stable_marriage_problem#Go
- https://github.com/chasestarr/match
- Ensures "there does not exist any match
- Gale-Shapley algorithm -
- assignment problem
- Hungarian algorithm -
O(n^4)- Finds lowest overall cost
- https://godoc.org/github.com/cpmech/gosl/graph#Munkres
- Hungarian algorithm -
- bilinear map
- Pearson correlation
- Miller's Weil Pairing Algorithm
- all pairs similarity search
- https://twitter.com/aidanfeldman/status/932783372442701824