An algorithm to find the link constrained Steiner tree in undirected graphs

DOI10.1007/978-3-319-42432-3_63MaRDI QIDQ2819269zbMATH OpenOpenAlexWikidataFDO

Authors Luigi Di Puglia Pugliese, Giovanna Miglionico, Manlio Gaudioso, Francesca Guerriero

Publication date 28 September 2016

Published in Mathematical Software – ICMS 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-42432-3_63

zbMATH Keywords

constrained Steiner treeLagrangean relaxation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
• Solving Steiner tree problems in graphs with Lagrangian relaxation
• A constrained Steiner tree problem
• An SST-based algorithm for the steiner problem in graphs
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches

Cites work

• A survey of combinatorial optimization problems in multicast routing
• An exact algorithm for the Steiner tree problem with delays
• Diameter-constrained Steiner tree
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Optimal multicast route packing
• Steiner tree problems
• The Complexity of Computing Steiner Minimal Trees
• The Steiner tree problem with delays: a compact formulation and reduction procedures
• The Steiner tree problem with hop constraints

Cited in

(4)

• Optimal Steiner trees under node and edge privacy conflicts
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
• Local search for hop-constrained directed Steiner tree problem with application to UAV-based multi-target surveillance
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems

This page was built for publication: An algorithm to find the link constrained Steiner tree in undirected graphs

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