scientific article; zbMATH DE number 4063109

zbMATH Open0652.05016MaRDI QIDQ3797192FDOQ3797192

Authors: Lawrence T. Kou, Kia Makki 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

approximation algorithmSteiner treeSteiner problem in graphs

Mathematics Subject Classification ID

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

Cited In (23)

• Fast local search for Steiner trees in graphs
• 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
• The Power of Dynamic Distance Oracles
• The Steiner problem with edge lengths 1 and 2
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A faster approximation algorithm for the Steiner tree problem in graphs
• Faster algorithm for optimum Steiner trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Steiner's problem in graphs: Heuristic methods
• A parallel algorithm for computing Steiner trees in strongly chordal graphs
• Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
• On efficient implementation of an approximation algorithm for the Steiner tree problem
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• Heuristics for the Steiner problem in graphs
• A fast algorithm for computing steiner edge connectivity
• Approximating Steiner trees in graphs with restricted weights

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)