scientific article; zbMATH DE number 26676

MaRDI QIDQ3983367zbMATH OpenFDO

Authors Alex Zelikovsky

Publication date 27 June 1992

zbMATH Keywords

minimal spanning treeSteiner problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3918122
• scientific article; zbMATH DE number 125502
• On finding steiner vertices
• A faster approximation algorithm for the Steiner problem in graphs

Cited in

(5)

• A faster approximation algorithm for the Steiner tree problem in graphs
• An estimate of the objective function optimum for the network Steiner problem
• scientific article; zbMATH DE number 5158878
• On finding steiner vertices
• The Steiner Problem for Count Matroids

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