A Distributed Primal-Dual Heuristic for Steiner Problems in Networks

DOI10.1007/978-3-540-72845-0_14MaRDI QIDQ5432316zbMATH OpenOpenAlexFDO

Authors

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72845-0_14

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Recommendations

• A distributed dual ascent algorithm for Steiner problems in multicast routing
• scientific article; zbMATH DE number 1304096
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
• Computing and Combinatorics
• A note on distributed multicast routing in point-to-point networks

Cited in

(9)

• Combinatorial optimization in system configuration design
• Neural and delay based heuristics for the Steiner problem in networks
• Distributed multicast routing in point-to-point networks
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
• Evaluating Steiner-tree heuristics and diameter variations for application layer multicast
• scientific article; zbMATH DE number 1304096 (Why is no real title available?)
• Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
• A distributed dual ascent algorithm for Steiner problems in multicast routing
• A note on distributed multicast routing in point-to-point networks

Describes a project that uses

Uses Software

• SteinLib

This page was built for publication: A Distributed Primal-Dual Heuristic for Steiner Problems in Networks

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