An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs

DOI10.1007/978-3-319-42432-3_63zbMath1434.68356OpenAlexW2505591575WikidataQ57354066 ScholiaQ57354066MaRDI QIDQ2819269

Giovanna Miglionico, Luigi Di Puglia Pugliese, 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

Lagrangean relaxationconstrained Steiner tree

Mathematics Subject Classification ID

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

Related Items (3)

Optimal Steiner trees under node and edge privacy conflicts ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem

Cites Work

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

This page was built for publication: An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs