The Steiner problem in graphs: topological methods of solution

DOI10.1023/B:AURC.0000019376.31168.20MaRDI QIDQ2487739zbMATH OpenFDO

Authors A. V. Panyukov

Publication date 8 August 2005

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:AURC.0000019376.31168.20

zbMATH Keywords

networkSteiner problem

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• An SST-based algorithm for the steiner problem in graphs
• scientific article; zbMATH DE number 3871417
• scientific article; zbMATH DE number 4128830
• An algorithm for the steiner problem in graphs
• Steiner's problem in graphs: Heuristic methods

Cited in

(12)

• Finding extremal carcasses with preset vertex degrees by the replacement method
• Construction of the current Steiner network of the second optimality rank
• Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph
• The big valley conjecture for the flow Steiner tree problem
• Using structured steiner trees for hierarchical global routing
• scientific article; zbMATH DE number 5158878
• Approaches to the Steiner Problem in Networks
• scientific article; zbMATH DE number 49566 (Why is no real title available?)
• Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
• scientific article; zbMATH DE number 1532673 (Why is no real title available?)
• The generalized Steiner cable-trench problem with application to error correction in vascular image analysis
• On segmenting logistical zones for servicing continuously developed consumers

This page was built for publication: The Steiner problem in graphs: topological methods of solution

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