Steiner problem in Halin networks

DOI10.1016/0166-218X(87)90031-XzbMath0623.94024MaRDI QIDQ1092013

Pawel Winter

Publication date: 1987

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

zbMATH Keywords

optimization; Steiner problem; linear time algorithm; Halin network

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

94C15: Applications of graph theory to circuits and networks

Related Items

Constrained Steiner trees in Halin graphs, Steiner tree problems, A survey of very large-scale neighborhood search techniques, Problems with generalized Steiner problems, Traveling salesman problem under categorization, On perfectly two-edge connected graphs, Efficiently solvable special cases of hard combinatorial optimization problems, Critical extreme points of the 2-edge connected spanning subgraph polytope, Steiner problem in networks: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for Steiner trees
• Parallel concepts in graph theory
• Steiner trees, partial 2–trees, and minimum IFI networks
• Characterization and Recognition of Partial 3-Trees
• Steiner problem in networks: A survey
• An integer linear programming approach to the steiner problem in graphs
• Une heuristique pour le problème de l'arbre de Steiner
• Halin graphs and the travelling salesman problem
• 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