Routing to Multiple Destinations in Computer Networks

Cited In (24)

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

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)