A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree

MaRDI QIDQ2816044zbMATH OpenFDO

Authors M. M. Ibrahim Mohamed, B. Tawfik

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305800927?np=y

zbMATH Keywords

dynamic programmingheuristic algorithmsminimum spanning treePrim heuristicSteiner tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An Approximation Scheme for Finding Steiner Trees with Obstacles
• An optimal algorithm for rectilinear steiner trees for channels with obstacles
• Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
• Steiner minimal trees with one polygonal obstacle.
• An algorithm for exact rectilinear Steiner trees for switchbox with obstacles

This page was built for publication: A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816044)