The edge-disjoing steiner problem in graphs

DOI10.1080/02331939608844173MaRDI QIDQ4893707zbMATH OpenOpenAlexFDO

Authors F. A. Compagner, Cees Duin, A. Volgenant

Publication date 18 September 1996

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939608844173

zbMATH Keywords

edge disjoint Steiner problemLagrange relaxationNP-completereliabilitySteiner problem in graphstree of minimum total weightupper bound generation

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Edge-disjoint Steiner trees and connectors in graphs
• scientific article; zbMATH DE number 4010182
• scientific article; zbMATH DE number 3871417
• Edge disjoint Steiner trees in graphs without large bridges
• Bounds on the maximum number of edge-disjoint Steiner trees of a graph
• The edge Steiner number of a graph
• The edge Steiner number of a graph
• An edge elimination test for the Steiner problem in graphs
• Some generalizations of the steiner problem in graphs
• The Steiner connectivity problem

Cites work

• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• An SST-based algorithm for the steiner problem in graphs
• scientific article; zbMATH DE number 1424551 (Why is no real title available?)
• On convergence rates of subgradient optimization methods
• Planar Formulae and Their Uses
• Reduction tests for the steiner problem in grapsh
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Validation of subgradient optimization

Cited in

(3)

• Constructing edge-disjoint Steiner paths in lexicographic product networks
• Steiner diagrams and \(k\)-star hubs
• Counting Problems Associated With Steiner Trees In Graphs

This page was built for publication: The edge-disjoing steiner problem in graphs

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