Abstract: Optimal solutions of task assignment problems like, e.g., subcarrier allocation for OFDM, are solved in polynomial time with the Hungarian algorithm. The sequential nature of the related ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results