메뉴 건너뛰기




Volumn 29, Issue 7, 2002, Pages 905-924

Heuristic algorithms for packing of multiple-group multicasting

Author keywords

Multicast routing; Network optimization; Shortest path problem; Steiner tree problem

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; MULTIMEDIA SYSTEMS; OPTIMIZATION; ROUTERS; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

EID: 0036604761     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00092-7     Document Type: Article
Times cited : (39)

References (30)
  • 7
    • 0015200656 scopus 로고
    • Steiner's problem in graphs and it's implications
    • (1971) Networks , vol.1 , pp. 113-133
    • Hakimi, S.L.1
  • 10
    • 84987041397 scopus 로고
    • A lower bound for the Steiner tree problem in directed graphs
    • (1990) Networks , vol.20 , pp. 765-778
    • Liu, W.G.1
  • 11
  • 20
    • 84987034438 scopus 로고
    • Steiner problem in networks: A survey
    • (1987) Networks , vol.17 , pp. 129-167
    • Winter, P.1


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