scientific article; zbMATH DE number 1424549

MaRDI QIDQ4945798zbMATH OpenFDO

Authors Siu-Wing Cheng

Publication date 18 March 2002

zbMATH Keywords

grid graphsGSMT problemSteiner trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Review text

We surveyed several closely related algorithmic techniques and structural properties that have been developed for finding exact Steiner trees in graphs and grid graphs. The aim is to give a coherent exposition of these materials so as to inspire future work on the GSMT problem. For the entire collection see [Zbl 0932.00010].

Recommendations

• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• scientific article; zbMATH DE number 1305548
• scientific article; zbMATH DE number 1424547
• scientific article; zbMATH DE number 970831
• Euclidean Steiner minimum trees: An improved exact algorithm

Cited in

(3)

• Steiner trees in uniformly quasi-bipartite graphs.
• On Steiner trees and minimum spanning trees in hypergraphs
• EXTREME STEINER GRAPHS

This page was built for publication:

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