Steiner's problem in graphs: heuristic methods
Discrete Applied Mathematics - Special issue: combinatorial methods in VLSI
The Steiner problem in distributed computing systems
Information Sciences: an International Journal
Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
Distributed multicast routing in point-to-point networks
Computers and Operations Research
Improved algorithms for the Steiner problem in networks
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
A note on distributed multicast routing in point-to-point networks
Computers and Operations Research
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
An Efficient Distributed Algorithm for Generating Multicast Distribution Trees
ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
Combinatorial optimization in system configuration design
Automation and Remote Control
Dominating sets of agents in visibility graphs: distributed algorithms for art gallery problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
| Hi-index | 0.00 |
Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the later case being particularly suitable to cases where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, since one cannot assume that a central node has complete information about the topology and the state of a large wide area network. This paper introduces a distributed version of a primal-dual heuristic (known as Dual Ascent), known for its remarkable good practical results, lower and upper bounds, in both undirected and directed Steiner problems. Experimental results and complexity analysis are also presented, showing the efficiency of the proposed algorithm when compared with the best distributed algorithms in the literature.