scientific article; zbMATH DE number 169458

MaRDI QIDQ4038157zbMATH OpenFDO

Authors Qicheng Lu

Publication date 16 May 1993

zbMATH Keywords

approximation algorithmminimum spanning treeSteiner treetime complexity

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A faster approximation algorithm for the Steiner tree problem in graphs
• scientific article; zbMATH DE number 4063109
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• A Faster Algorithm for the Steiner Tree Problem
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• Faster approximation algorithms for the rectilinear Steiner tree problem
• scientific article; zbMATH DE number 139910
• Faster algorithm for optimum Steiner trees
• A note on A faster approximation algorithm for the Steiner problem in graphs

Cited in

(6)

• A note on A faster approximation algorithm for the Steiner problem in graphs
• The Power of Dynamic Distance Oracles
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• scientific article; zbMATH DE number 5313630 (Why is no real title available?)
• A fast algorithm for computing steiner edge connectivity
• On efficient implementation of an approximation algorithm for the Steiner tree problem

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 Q4038157)