scientific article; zbMATH DE number 222076

MaRDI QIDQ4697358zbMATH OpenFDO

Authors Peter H. Richter

Publication date 29 June 1993

zbMATH Keywords

generalized minimum spanning treeheuristicsshortest path tree algorithms

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) 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
• scientific article; zbMATH DE number 4063109
• On efficient implementation of an approximation algorithm for the Steiner tree problem
• scientific article; zbMATH DE number 3871417

Cited in

(12)

• A note on A faster approximation algorithm for the Steiner problem in graphs
• The partial sum criterion for Steiner trees in graphs and shortest paths
• A robust and scalable algorithm for the Steiner problem in graphs
• Two variations of the minimum Steiner problem
• scientific article; zbMATH DE number 3871417 (Why is no real title available?)
• An SST-based algorithm for the steiner problem in graphs
• scientific article; zbMATH DE number 4128830 (Why is no real title available?)
• Efficient path and vertex exchange in steiner tree algorithms
• scientific article; zbMATH DE number 219265 (Why is no real title available?)
• scientific article; zbMATH DE number 1926656 (Why is no real title available?)
• Fast local search for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem 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 Q4697358)