An edge elimination test for the Steiner problem in graphs

DOI10.1016/0167-6377(89)90005-9zbMath0665.90093OpenAlexW2004092973MaRDI QIDQ1116902

A. Volgenant, Cees W. Duin

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90005-9

zbMATH Keywords

shortest pathminimum spanning treesbottleneck lengthgraph reductionreduction testsLeast Cost testspecial distanceSteiner Problem in graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items

Reducing the hierarchical network design problem, Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm, The multi-weighted Steiner tree problem, The role of Steiner hulls in the solution to Steiner tree problems, Two new criteria for finding Steiner hulls in Steiner tree problems, Steiner's problem in graphs: Heuristic methods, Implications, conflicts, and reductions for Steiner trees, Implications, conflicts, and reductions for Steiner trees, The dynamic predicate stashing copy problem and the Steiner problem in graphs, Minimum deviation and balanced optimization: A unified approach

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Reducing the hierarchical network design problem
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Some generalizations of the steiner problem in graphs
• Steiner problem in networks: A survey
• An SST-based algorithm for the steiner problem in graphs
• Reduction tests for the steiner problem in grapsh
• Steiner's problem in graphs and its implications
• An algorithm for the steiner problem in graphs