Problem reduction methods and a tree generation algorithm for the steiner network problem

DOI10.1002/NET.3230170107MaRDI QIDQ3786299zbMATH OpenOpenAlexFDO

Authors Anantaram Balakrishnan, Nitin R. Patel

Publication date 1987

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230170107

zbMATH Keywords

minimal spanning treeminimum weight connected subgraphproblem reduction procedureSteiner network problemtree generation algorithm

Mathematics Subject Classification ID

Trees (05C05) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1947441
• scientific article; zbMATH DE number 1182759
• Publication:3471884
• Reductions for the rectilinear steiner tree problem
• On reductions for the Steiner problem in graphs
• Solving Steiner tree problems in graphs to optimality
• Steiner tree problems
• Steiner tree problems
• Implications, conflicts, and reductions for Steiner trees
• Implications, conflicts, and reductions for Steiner trees

Cites work

• On the Problem of Steiner

Cited in

(20)

• An edge elimination test for the Steiner problem in graphs
• Branch-and-bound as a higher-order function
• The multi-weighted Steiner tree problem
• An approach for the Steiner problem in directed graphs
• The role of Steiner hulls in the solution to Steiner tree problems
• An integrated approach to routing and via minimization
• Path-distance heuristic for the Steiner problem in undirected networks
• Steiner's problem in graphs: Heuristic methods
• Graph simplification for infrastructure network design
• Reduction tests for the prize-collecting Steiner problem
• Models and algorithms for network reduction
• Using structured steiner trees for hierarchical global routing
• Some generalizations of the steiner problem in graphs
• Preprocessing Steiner problems from VLSI layout
• Reductions for the rectilinear steiner tree problem
• The Steiner tree problem with delays: a compact formulation and reduction procedures
• A comparison of Steiner tree relaxations
• Heuristic algorithms for packing of multiple-group multicasting
• An exact branch and bound algorithm for the Steiner Problem in Graphs
• A factoring approach for the Steiner tree problem in undirected networks

This page was built for publication: Problem reduction methods and a tree generation algorithm for the steiner network problem

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