A survey of approximation algorithms for multicast congestion problems
Rong-Jou Yang, Hann‐Jang Ho, SingLing Lee · International Conference on Telecommunications · 2006
Due to the recently rapid development of multimedia applications, multicast has become the critical technique in many network applications. In this paper, We investigate contemporary research concerning multicast congestion problems with the objective of minimizing the maximum sharing of a link. These problems include: multicast Steiner tree and multicast packing problem, etc. Most of these problems have already been proved as NP-complete, thus are mainly formulated as the Integer Linear Programming (ILP). Our objective is to investigate and analyze some of most recently developed approximation algorithms for the optimization of multicast congestion problems. We also discus how they are modelled and solved in the literature.