Steiner's problem in graphs: Heuristic methods

DOI10.1016/0166-218X(92)90021-2MaRDI QIDQ1201819zbMATH OpenOpenAlexFDO

Authors Stefan Voß

Publication date 17 January 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(92)90021-2

zbMATH Keywords

approximation algorithmSteiner treeexperimental comparison

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for the Steiner problem in graphs
• A heuristic for the Steiner problem in graphs
• scientific article; zbMATH DE number 125486
• An algorithm for the steiner problem in graphs
• Publication:4945803
• Approaches to the Steiner Problem in Networks
• scientific article; zbMATH DE number 4010182
• Steiner tree problems
• Steiner tree problems
• Path-distance heuristic for the Steiner problem in undirected networks

Cites work

• scientific article; zbMATH DE number 4139520 (Why is no real title available?)
• scientific article; zbMATH DE number 3917752 (Why is no real title available?)
• scientific article; zbMATH DE number 3918122 (Why is no real title available?)
• scientific article; zbMATH DE number 3985248 (Why is no real title available?)
• scientific article; zbMATH DE number 4049088 (Why is no real title available?)
• scientific article; zbMATH DE number 4063109 (Why is no real title available?)
• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 3717342 (Why is no real title available?)
• scientific article; zbMATH DE number 3735154 (Why is no real title available?)
• scientific article; zbMATH DE number 49566 (Why is no real title available?)
• scientific article; zbMATH DE number 3538520 (Why is no real title available?)
• A dual ascent approach for steiner tree problems on a directed graph
• A fast algorithm for Steiner trees
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• An SST-based algorithm for the steiner problem in graphs
• An algorithm for the steiner problem in graphs
• An edge elimination test for the Steiner problem in graphs
• An integer linear programming approach to the steiner problem in graphs
• Combinatorial heuristic algorithms with FORTRAN
• On efficient implementation of an approximation algorithm for the Steiner tree problem
• On finding steiner vertices
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Path-distance heuristic for the Steiner problem in undirected networks
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Reduction tests for the steiner problem in grapsh
• Steiner problem in networks: A survey
• The computation of nearly minimal Steiner trees in graphs
• Une heuristique pour le problème de l'arbre de Steiner
• Worst-case performance of Rayward-Smith's Steiner tree heuristic

Cited in

(26)

• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
• scientific article; zbMATH DE number 4128830 (Why is no real title available?)
• Dual heuristics on the exact solution of large Steiner problems
• scientific article; zbMATH DE number 32742 (Why is no real title available?)
• A heuristic for the Steiner problem in graphs
• Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree
• A robust and scalable algorithm for the Steiner problem in graphs
• Combined column-and-row-generation for the optimal communication spanning tree problem
• scientific article; zbMATH DE number 3871417 (Why is no real title available?)
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut
• Approaches to the Steiner Problem in Networks
• Optimal Steiner trees under node and edge privacy conflicts
• Worst-case performance of some heuristics for Steiner's problem in directed graphs
• Generalized spanning trees
• Combinatorial optimization in system configuration design
• scientific article; zbMATH DE number 4139520 (Why is no real title available?)
• Improved algorithms for the Steiner problem in networks
• Solving Steiner trees: Recent advances, challenges, and perspectives
• scientific article; zbMATH DE number 4049088 (Why is no real title available?)
• Steiner trees and polyhedra
• Local search for the Steiner tree problem in the Euclidean plane
• scientific article; zbMATH DE number 11140 (Why is no real title available?)
• A heuristic for Euclidean and rectilinear Steiner problems
• scientific article; zbMATH DE number 1926656 (Why is no real title available?)
• A note on distributed multicast routing in point-to-point networks
• The Steiner problem in graphs: topological methods of solution

This page was built for publication: Steiner's problem in graphs: Heuristic methods

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