A Distributed Primal-Dual Heuristic for Steiner Problems in Networks

DOI10.1007/978-3-540-72845-0_14zbMATH Open1203.68127OpenAlexW1766029762MaRDI QIDQ5432316

Author name not available (Why is that?)

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)

Related Items (4)

A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem ⋮ A distributed dual ascent algorithm for Steiner problems in multicast routing ⋮ Combinatorial optimization in system configuration design ⋮ Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree

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)