Routing to Multiple Destinations in Computer Networks
From MaRDI portal
Publication:4742316
DOI10.1109/TCOM.1983.1095818zbMath0505.68031MaRDI QIDQ4742316
Jeffrey M. Jaffe, Kadaba Bharath-Kumar
Publication date: 1983
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
traveling salesmanheuristic algorithmsminimum spanning treeminimum pathnetwork coststore-and-forward computer network
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)
Related Items
Minimum \(k\) arborescences with bandwidth constraints, Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint, Balancing minimum spanning trees and shortest-path trees, A survey of combinatorial optimization problems in multicast routing, Worst-case performance of Rayward-Smith's Steiner tree heuristic, Approximability results for the $p$-centdian and the converse centdian problems, Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem, Approximability results for the converse connectedp-centre problem†, Polynomial time approximation schemes for the constrained minimum spanning tree problem, Minimum cost multicast routing using ant colony optimization algorithm, Heuristics for the Steiner problem in graphs, THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM, The minimum cost shortest-path tree game, Low-light trees, and tight lower bounds for Euclidean spanners, 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, A 3.4713-approximation algorithm for the capacitated multicast tree routing problem, Mixed-integer programming approaches for the tree \(t^*\)-spanner problem, Neural and delay based heuristics for the Steiner problem in networks, Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones, Bicriteria Network Design Problems, Approximating the weight of shallow Steiner trees, Algorithms for multicast connection under multi-path routing model.
