메뉴 건너뛰기




Volumn 390, Issue 1, 2008, Pages 81-91

An improved approximation algorithm for capacitated multicast routings in networks

Author keywords

Approximation algorithm; Graph algorithm; Multicast routing problem; Network optimization; Tree cover

Indexed keywords

MULTICASTING; NETWORK ROUTING; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

EID: 37349029662     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.10.021     Document Type: Article
Times cited : (9)

References (10)
  • 1
    • 26844457943 scopus 로고    scopus 로고
    • Improved approximation algorithms for the capacitated multicast routing problem
    • Cai Z., Lin G.-H., and Xue G. Improved approximation algorithms for the capacitated multicast routing problem. LNCS vol. 3595 (2005) 136-145
    • (2005) LNCS , vol.3595 , pp. 136-145
    • Cai, Z.1    Lin, G.-H.2    Xue, G.3
  • 2
    • 0037120703 scopus 로고    scopus 로고
    • Algorithm for multicast connection under multi-path routing model
    • Gu J., Hu X.-D., and Zhang M.-H. Algorithm for multicast connection under multi-path routing model. Information Processing Letters 84 (2002) 31-39
    • (2002) Information Processing Letters , vol.84 , pp. 31-39
    • Gu, J.1    Hu, X.-D.2    Zhang, M.-H.3
  • 3
    • 0842265039 scopus 로고    scopus 로고
    • Routing algorithm for multicast under multi-tree model in optical networks
    • Gu J., Hu X.-D., and Zhang M.-H. Routing algorithm for multicast under multi-tree model in optical networks. Theoretical Computer Science 314 (2004) 293-301
    • (2004) Theoretical Computer Science , vol.314 , pp. 293-301
    • Gu, J.1    Hu, X.-D.2    Zhang, M.-H.3
  • 4
    • 37349091387 scopus 로고    scopus 로고
    • R.L. Hadas, Efficient collective communication in WDM networks with a power budget, in: Proceeding of IEEE Internat. Conf. Comput Comm. Network, 2000, pp. 612-616
  • 5
    • 35048897548 scopus 로고    scopus 로고
    • Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
    • Proceedings of ICALP 2004
    • Jothi R., and Raghavachari B. Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. Proceedings of ICALP 2004. LNCS vol. 3142 (2004) 805-818
    • (2004) LNCS , vol.3142 , pp. 805-818
    • Jothi, R.1    Raghavachari, B.2
  • 6
    • 23944455069 scopus 로고    scopus 로고
    • An improved approximation algorithm for multicast k-tree routing
    • Lin G.-H. An improved approximation algorithm for multicast k-tree routing. Journal of Combinatorial Optimization 9 (2004) 349-356
    • (2004) Journal of Combinatorial Optimization , vol.9 , pp. 349-356
    • Lin, G.-H.1
  • 7
    • 37349020909 scopus 로고    scopus 로고
    • Approximation algorithms for multicast routings in a network with multi-sources
    • Morsy E., and Nagamochi H. Approximation algorithms for multicast routings in a network with multi-sources. IEICE Transactions E90-A 5 (2007) 900-906
    • (2007) IEICE Transactions , vol.E90-A , Issue.5 , pp. 900-906
    • Morsy, E.1    Nagamochi, H.2
  • 8
    • 0033881821 scopus 로고    scopus 로고
    • G. Robins, A.Z. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, 2000, pp. 770-779
  • 9
    • 0033078487 scopus 로고    scopus 로고
    • Light-trees: Optical multicasting for improved performance in wavelength-routed networks
    • Sahasrabuddhe L.H., and Mukherjee B. Light-trees: Optical multicasting for improved performance in wavelength-routed networks. IEEE Communications Magazine 37 2 (1999) 67-73
    • (1999) IEEE Communications Magazine , vol.37 , Issue.2 , pp. 67-73
    • Sahasrabuddhe, L.H.1    Mukherjee, B.2
  • 10
    • 0033900912 scopus 로고    scopus 로고
    • Multicast routing algorithms and protocols: A tutorial
    • Sahasrabuddhe L.H., and Mukherjee B. Multicast routing algorithms and protocols: A tutorial. IEEE Network 14 1 (2000) 90-102
    • (2000) IEEE Network , vol.14 , Issue.1 , pp. 90-102
    • Sahasrabuddhe, L.H.1    Mukherjee, B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.