Path-distance heuristic for the Steiner problem in undirected networks

DOI10.1007/BF01758765zbMath0748.05052OpenAlexW2063395464MaRDI QIDQ1186805

Pawel Winter, James MacGregor Smith

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01758765

zbMATH Keywords

Steiner problemshortest distancepath-distance heuristic

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A survey of combinatorial optimization problems in multicast routing, A heuristic for the Steiner problem in graphs, A factoring approach for the Steiner tree problem in undirected networks, Solving group Steiner problems as Steiner problems., The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs, Minimum cost multicast routing using ant colony optimization algorithm, Unnamed Item, Steiner's problem in graphs: Heuristic methods, Steiner trees and polyhedra, Improved algorithms for the Steiner problem in networks, Mathematical methods for physical layout of printed circuit boards: an overview, Heuristic algorithms for packing of multiple-group multicasting, Unnamed Item, Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Worst-case performance of Rayward-Smith's Steiner tree heuristic
• A fast algorithm for Steiner trees
• A dual ascent approach for steiner tree problems on a directed graph
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• On finding steiner vertices
• Steiner problem in networks: A survey
• An SST-based algorithm for the steiner problem in graphs
• Reduction tests for the steiner problem in grapsh
• An integer linear programming approach to the steiner problem in graphs
• Une heuristique pour le problème de l'arbre de Steiner
• The computation of nearly minimal Steiner trees in graphs
• Steiner's problem in graphs and its implications
• The steiner problem in graphs
• An algorithm for the steiner problem in graphs
• An algorithm for the steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs