Steiner problem in Halin networks

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

Pawel Winter

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0166-218x(87)90031-x

zbMATH Keywords

optimizationSteiner problemlinear time algorithmHalin network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Related Items

Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ On perfectly two-edge connected graphs ⋮ Efficiently solvable special cases of hard combinatorial optimization problems ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Steiner problem in networks: A survey ⋮ Problems with generalized Steiner problems ⋮ Traveling salesman problem under categorization ⋮ A survey of very large-scale neighborhood search techniques ⋮ Steiner tree problems ⋮ Constrained Steiner trees in Halin graphs ⋮ Revising Johnson's table for the 21st century ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item