A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem

DOI10.1016/j.orl.2009.09.008zbMath1182.90055OpenAlexW2093592023MaRDI QIDQ2270325

Yanyan Li

Publication date: 18 March 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.09.008

zbMATH Keywords

distributed algorithmsSteiner treemulticast routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (6)

Finding outbreak trees in networks with limited information ⋮ Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints ⋮ A branch-and-cut algorithm for the Steiner tree problem with delays ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem ⋮ The Steiner tree problem with delays: a compact formulation and reduction procedures

Uses Software

• BRITE
• SteinLib

Cites Work

• Unnamed Item
• A survey of combinatorial optimization problems in multicast routing
• Small-world characteristics of internet topologies and implications on multicast scaling
• A dual ascent approach for steiner tree problems on a directed graph
• A distributed dual ascent algorithm for Steiner problems in multicast routing
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

This page was built for publication: A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem