scientific article; zbMATH DE number 4063109

MaRDI QIDQ3797192zbMATHFDO

Authors Lawrence T. Kou, Kia Makki

Publication date 1987

zbMATH Keywords

approximation algorithmSteiner treeSteiner problem in graphs

Mathematics Subject Classification ID

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

Recommendations

• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• On efficient implementation of an approximation algorithm for the Steiner tree problem
• scientific article; zbMATH DE number 1445376
• A faster approximation algorithm for the Steiner tree problem in graphs

Cited in

(23)

• Approximating Steiner trees in graphs with restricted weights
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• A fast algorithm for computing steiner edge connectivity
• Faster algorithm for optimum Steiner trees
• A parallel algorithm for computing Steiner trees in strongly chordal graphs
• scientific article; zbMATH DE number 125502 (Why is no real title available?)
• scientific article; zbMATH DE number 169458 (Why is no real title available?)
• The Steiner problem with edge lengths 1 and 2
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• On efficient implementation of an approximation algorithm for the Steiner tree problem
• Heuristics for the Steiner problem in graphs
• Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
• A note on A faster approximation algorithm for the Steiner problem in graphs
• Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
• scientific article; zbMATH DE number 5313630 (Why is no real title available?)
• The Power of Dynamic Distance Oracles
• Steiner's problem in graphs: Heuristic methods
• scientific article; zbMATH DE number 139910 (Why is no real title available?)
• 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
• scientific article; zbMATH DE number 222076 (Why is no real title available?)
• A faster approximation algorithm for the Steiner tree problem in graphs
• Fast local search for Steiner trees in 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 Q3797192)