arXiv · 2601.22415
On the Optimality of Rate Balancing for Max-Min Fair Multicasting
Abstract
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 between rate balancing and the optimal MMF multicasting solution under certain conditions. Based on this theoretical insight, we propose a low-complexity algorithm for MMF multicasting that yields closed-form solutions. Simulation results validate our analysis and demonstrate that the proposed algorithm outperforms the state-of-the-art methods while being computationally more efficient.
Explore related subjects
Keep this discovery
Sadaf Syed, Wolfgang Utschick, Michael Joham. 2026-01-29. On the Optimality of Rate Balancing for Max-Min Fair Multicasting. https://arxiv.org/abs/2601.22415
Cite the original work for its findings. Save a collection to share your selection of sources.