Routing to Multiple Destinations in Computer Networks

Cited in

(23)

THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
Minimum $k$ arborescences with bandwidth constraints
Algorithms for multicast connection under multi-path routing model.
Steiner shallow-light trees are exponentially lighter than spanning ones
Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint
Approximability results for the $p$-centdian and the converse centdian problems
Modifying networks to obtain low cost trees
Heuristics for the Steiner problem in graphs
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
Worst-case performance of Rayward-Smith's Steiner tree heuristic
Polynomial time approximation schemes for the constrained minimum spanning tree problem
Balancing minimum spanning trees and shortest-path trees
The minimum cost shortest-path tree game
Neural and delay based heuristics for the Steiner problem in networks
Low-light trees, and tight lower bounds for Euclidean spanners
Approximability results for the converse connected $p$-centre problem
Size-constrained tree partitioning: approximating the multicast $k$-tree routing problem
A survey of combinatorial optimization problems in multicast routing
Approximating the weight of shallow Steiner trees
Multicastad hocrouting through mobility-aware Steiner tree meshes with consistency across different mobility models
A shortest path routing algorithm using Hopfield neural network with an improved energy function
Minimum cost multicast routing using ant colony optimization algorithm
Mixed-integer programming approaches for the tree $t^*$-spanner problem

This page was built for publication: Routing to Multiple Destinations in Computer Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742316)