scientific article; zbMATH DE number 139919

MaRDI QIDQ4028261zbMATH OpenFDO

Authors Bernard M. Waxman

Publication date 28 March 1993

zbMATH Keywords

approximation algorithmsapproximation schemesRayward-Smith's algorithmSteiner tree problemworst-case performance

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

• scientific article; zbMATH DE number 1445376
• scientific article; zbMATH DE number 1305435
• A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
• A faster approximation algorithm for the Steiner problem in graphs
• scientific article; zbMATH DE number 742979

Cited in

(6)

• Worst-case performance of Rayward-Smith's Steiner tree heuristic
• Contraction-based Steiner tree approximations in practice
• Approximating Alternative Solutions
• scientific article; zbMATH DE number 1305435 (Why is no real title available?)
• Strong Steiner tree approximations in practice
• How Many Steiner Terminals Can You Connect in 20 Years?

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