Algorithms for degree-constrained Euclidean Steiner minimal tree

DOI10.1016/S1004-4132(08)60146-2zbMATH Open1218.68163OpenAlexW2405456634MaRDI QIDQ3087683FDOQ3087683

Authors: Jin Zhang, Liang Ma, Liantang Zhang 

Publication date: 16 August 2011

Published in: Journal of Systems Engineering and Electronics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1004-4132(08)60146-2

Recommendations

• Variations on the Euclidean Steiner tree problem and algorithms
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
• A note on genetic algorithms for degree-constrained spanning tree problems
• scientific article; zbMATH DE number 4104398
• A degree based approach to find Steiner trees

zbMATH Keywords

simulated annealingant algorithmEuclidean Steiner minimal treedegree-constrained

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Algorithms for degree-constrained Euclidean Steiner minimal tree

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