Skip to main navigation
Skip to search
Skip to main content
Hong Kong Baptist University Home
Help & FAQ
Home
Scholars
Departments / Units
Research Output
Projects / Grants
Prizes / Awards
Activities
Press/Media
Student theses
Datasets
Search by expertise, name or affiliation
Lower bound for multimedia multicast routing
Y. W. Leung
*
, B. T. Yang
*
Corresponding author for this work
Department of Computer Science
Research output
:
Contribution to journal
›
Journal article
›
peer-review
5
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Lower bound for multimedia multicast routing'. Together they form a unique fingerprint.
Sort by:
Weight
Alphabetically
Keyphrases
Computation Time
33%
Delay Constraint
33%
Destination Node
33%
Heuristic Algorithms
66%
Lagrangean Relaxation
33%
Minimal Cost
33%
Multicast Routing
100%
Multicast Routing Problem
33%
Multicast Tree
66%
Multimedia Information
33%
Multimedia multicast
100%
Network Size
33%
NP-complete
33%
Numerical Results
33%
Problem Decomposition
33%
Source Node
33%
Tight
33%
Tight Lower Bound
33%
Workstation
33%
Computer Science
Computation Time
33%
Destination Node
33%
Heuristic Algorithm
66%
Lagrange Equation
33%
Multicast Routing
100%
multicast tree
66%
Multimedia
100%
Multimedia Information
33%
Routing Problem
33%