References
- 3GPP TR 25.803 S-CCPCH performance for MBMS, Sep. 2005
- 3GPP TS 22.146 Multimedia Broadcast/Multicast Service: Stagel , 3GPP, Mar. 2003
- Balakrishnan, A., T.L. Magnanti and R.T. Wong, 'A dual-ascent procedure for largescale uncapacitated network design,' Operations Research, Vol.37(1989), pp.716-740 https://doi.org/10.1287/opre.37.5.716
- Boni, A. et al., 'Multimedia Broadcast Multicast Service - Technology Overview and Service Aspects,' Fifth lEE International Conference on 3G Mobile Communication Technologies, 2004
- Broadcast-Multicast Service (BCMCS) Framework Draft Document, 3GPP2, 2003
- CDMA2000 High Rate Broadcast-Multicast Packet Data Air Interface Specification, 3GPP2 TSG-C SWG2.5, Aug. 2003
- Chudak, F., T. Roughgarden, and D.P. Williamson, 'Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation,' Mathematical Programming, Vol100(2004), pp.411-421 https://doi.org/10.1007/s10107-003-0479-2
- Erlenkotter, D., 'A dual based procedure for uncapacitated facility location,' Operations Research, Vol.26(1978), pp.992-1009 https://doi.org/10.1287/opre.26.6.992
- Fischetti, M., H. Hamacher, K. Jornsten, and F. Maffioli, 'Weighted k-Cardinality Trees:Complexity and Polyhedral Structure,' Networks, Vol.24(1994), pp.1l-21 https://doi.org/10.1002/net.3230240103
- Garey, M.R. and D.S. Johnson, Computers and intractability : a Guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979
- Garg, N., 'A 3-Approximation for the Minirrn.nn Tree Spanning k Vertices,' Proceedings of the 37th Annual Symposium on Foundations of Computer Science, (1996), pp.302-309
- Holma, H. and A. Toskala, WCDMA for UMTS, Wiley, 2000
- Tatesh, S. and S.K. Palat, 'Future Evolution of 3G Networks,' International Conference on Information and Communication Technologies : From Theory to Applications, 2004
- Wang, J., R. Sinnarajah, T. Chen, Y. Wei, and E. Tiedemann, 'Broadcast and Multicast Services in cdma 2000,' IEEE communications magazine, 2004
- Wong, R.T., 'A dual ascent approach for Steiner tree problems on a directed graph,' Mathematical Programming, Vol.28(1984), pp.271-287 https://doi.org/10.1007/BF02612335