scientific article; zbMATH DE number 11140

zbMATH Open0763.05024MaRDI QIDQ3974150FDOQ3974150

Authors: Mamadi Diané, Ján Plesník 

Publication date: 25 June 1992

Full work available at URL: https://eudml.org/doc/118284

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

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• 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
• 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

zbMATH Keywords

distancesheuristicsSteiner problemspanning tree heuristic

Mathematics Subject Classification ID

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

Cited In (6)

• 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\)
• Worst-case performance of some heuristics for Steiner's problem in directed graphs
• Heuristics for the Steiner problem in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)