On the Optimality of Rate Balancing for Max-Min Fair Multicasting

Sadaf Syed, Wolfgang Utschick, Michael Joham

The max-min fair (MMF) multicasting problem is known to be NP-hard. In this work, we analytically derive the optimal solution to this NP-hard problem and establish the equivalence…