A distributed dual ascent algorithm for Steiner problems in multicast routing

DOI10.1002/net.20276zbMath1192.68821OpenAlexW4256302751MaRDI QIDQ5191138

No author found.

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

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

Related Items (5)

A practical greedy approximation for the directed Steiner tree problem ⋮ A Practical Greedy Approximation for the Directed Steiner Tree Problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ The Clustered Selected-Internal Steiner Tree Problem ⋮ A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner problem in distributed computing systems
• Distributed multicast routing in point-to-point networks
• A survey of combinatorial optimization problems in multicast routing
• Distributed network protocols
• A dual ascent approach for steiner tree problems on a directed graph
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A note on distributed multicast routing in point-to-point networks
• Improved algorithms for the Steiner problem in networks

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