Lower and Upper Bounds for Multicasting under Distance Dependent Forwarding Cost Functions.
Hannes FreyPublished in: IEEE Trans. Parallel Distributed Syst. (2013)
Keyphrases
- lower and upper bounds
- cost function
- lower bound
- upper bound
- upper and lower bounds
- lagrangian relaxation
- distance measure
- search space reduction
- real world
- valid inequalities
- objective function
- euclidean distance
- branch and bound
- distance function
- multiple users
- itemsets
- association rules
- search algorithm
- optimal solution