Closed vatai closed 4 years ago
Let c[i, j] denote the amount of communication from partition i to partition j. The goal is to have the trace of c[*, *] to be maximal, i.e. to have most communication "to the same partition". A possible solution is the "Hungarian algorithm".
c[i, j]
i
j
c[*, *]
The basic algorithm is the "Hungarian algorithm": https://en.wikipedia.org/wiki/Hungarian_algorithm
This is one of the fastest versions: https://link.springer.com/article/10.1007/BF02278710
Also investigate this suggestion: https://www.researchgate.net/publication/220469495_Speeding_up_the_Hungarian_algorithm
The problem
Let
c[i, j]denote the amount of communication from partitionito partitionj. The goal is to have the trace ofc[*, *]to be maximal, i.e. to have most communication "to the same partition". A possible solution is the "Hungarian algorithm".References
The basic algorithm is the "Hungarian algorithm": https://en.wikipedia.org/wiki/Hungarian_algorithm
This is one of the fastest versions: https://link.springer.com/article/10.1007/BF02278710
Also investigate this suggestion: https://www.researchgate.net/publication/220469495_Speeding_up_the_Hungarian_algorithm