A distributed dual ascent algorithm for Steiner problems in multicast routing

DOI10.1002/NET.20276MaRDI QIDQ5191138zbMATH OpenOpenAlexFDO

Authors

Publication date 28 July 2009

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20276

zbMATH Keywords

distributed algorithmsmulticast routingSteiner problem in networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
• A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
• Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE
• The Steiner problem in distributed computing systems
• Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
• An optimal distributed routing algorithm using dual decomposition techniques
• Computing and Combinatorics
• A dual ascent approach for steiner tree problems on a directed graph

Cites work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A dual ascent approach for steiner tree problems on a directed graph
• A note on distributed multicast routing in point-to-point networks
• A survey of combinatorial optimization problems in multicast routing
• Distributed multicast routing in point-to-point networks
• Distributed network protocols
• Dual heuristics on the exact solution of large Steiner problems
• scientific article; zbMATH DE number 1304096 (Why is no real title available?)
• scientific article; zbMATH DE number 1926656 (Why is no real title available?)
• Improved algorithms for the Steiner problem in networks
• The Steiner problem in distributed computing systems

Cited in

(11)

• Distributed multicast routing in point-to-point networks
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
• Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
• A practical greedy approximation for the directed Steiner tree problem
• A practical greedy approximation for the directed Steiner tree problem
• scientific article; zbMATH DE number 1304096 (Why is no real title available?)
• A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
• Mathematical aspects of network routing optimization.
• A note on distributed multicast routing in point-to-point networks
• Solving Steiner trees: Recent advances, challenges, and perspectives
• The Clustered Selected-Internal Steiner Tree Problem

Describes a project that uses

Uses Software

• SteinLib

This page was built for publication: A distributed dual ascent algorithm for Steiner problems in multicast routing

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