improve the resource matching · afeld/tfmv#4

2017-11-21T05:54:46.000Z

Potential approaches: * [stable marriage problem](https://en.wikipedia.org/wiki/Stable_marriage_problem) * Gale-Shapley algorithm - `O(n^2)` * Ensures "there does not exist any match `(A, B)` by which both `A` and `B` would 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 * [assignment problem](https://en.wikipedia.org/wiki/Assignment_problem) * [Hungarian algorithm](https://en.wikipedia.org/wiki/Hungarian_algorithm) - `O(n^4)` * Finds lowest overall cost * https://godoc.org/github.com/cpmech/gosl/graph#Munkres * [bilinear map](https://en.wikipedia.org/wiki/Bilinear_map) * [Pearson correlation](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient) * Miller's Weil Pairing Algorithm * all pairs similarity search * https://twitter.com/aidanfeldman/status/932783372442701824

(0 commentaires) (0 réactions) (0 assignés)Go (2 forks)github user discovery

help wanted

Métriques du dépôt

Stars: (11 stars)
Métriques de merge PR: (Aucune PR mergée en 30 j)

Description

Potential approaches:

stable marriage problem
- Gale-Shapley algorithm - O(n^2)
  - Ensures "there does not exist any match (A, B) by which both A and B would 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
assignment problem
- Hungarian algorithm - O(n^4)
  - Finds lowest overall cost
  - https://godoc.org/github.com/cpmech/gosl/graph#Munkres
bilinear map
Pearson correlation
Miller's Weil Pairing Algorithm
all pairs similarity search
https://twitter.com/aidanfeldman/status/932783372442701824

Guide contributeur

Direction de recherche: Recherchez et implémentez l'algorithme Gale Shapley pour l'appariement stable des ressources Terraform. Étudiez les références fournies et adaptez l'implémentation Go au contexte du projet.
Stack technique: go
Domaine: backenddevops
Type d'issue: Fonctionnalité
Difficulté: 3
Temps estimé: Une demi journée
Statut d'activité: Récente
Clarté: Plutôt claire
Prérequis: GoAlgorithms
Accessibilité débutant: 30

Métriques du dépôt

Description

Guide contributeur

Recevez de nouvelles issues Easy par e-mail.