scientific article; zbMATH DE number 222076

zbMATH Open0778.68044MaRDI QIDQ4697358FDOQ4697358

Authors Peter H. Richter 

Publication date 29 June 1993

zbMATH Keywords

heuristicsgeneralized minimum spanning treeshortest 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

(10)

• An SST-based algorithm for the steiner problem in graphs
• Two variations of the minimum Steiner problem
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• A robust and scalable algorithm for the Steiner problem in graphs
• Title not available (Why is no real title available?)
• Fast local search for the Steiner problem in graphs
• A note on A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• Title not available (Why is no real title available?)

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)