scientific article; zbMATH DE number 11140

MaRDI QIDQ3974150zbMATH OpenFDO

Authors Mamadi Diané, Ján Plesník

Publication date 25 June 1992

Full work available at URL https://eudml.org/doc/118284, http://www.emis.de/journals/AMUC/_vol60n1.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

distancesheuristicsspanning tree heuristicSteiner problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 125486
• scientific article; zbMATH DE number 4128830
• Heuristics for the Steiner problem in graphs
• A heuristic for the Steiner problem in graphs
• Steiner's problem in graphs: Heuristic methods
• New approximation algorithms for the Steiner tree problems
• scientific article; zbMATH DE number 139910
• New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\)
• Publication:4945803
• Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study

Cited in

(8)

• Path-distance heuristic for the Steiner problem in undirected networks
• Heuristics for the Steiner problem in graphs
• Worst-case performance of some heuristics for Steiner's problem in directed graphs
• A robust and scalable algorithm for the Steiner problem in graphs
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
• New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\)
• scientific article; zbMATH DE number 1926656 (Why is no real title available?)
• scientific article; zbMATH DE number 1389815 (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 Q3974150)