A New Mathematical Formulation for Generating a Multicast Routing Tree
Jangha Kang, Donghan Kang, Sungsoo Park · 2006
To generate a multicast routing tree guaranteeing the quality of service (QoS), we consider the hop constrained Steiner tree problem and propose a new mathematical formulation for it, which contains fewer constraints than a known formulation. An efficient procedure is also proposed to solve the problem. Preliminary tests show that the procedure reduces the computing time significantly.