[ACM Press the 44th annual southeast reg
โ
Muhmmad, Rashid Bin
๐
Article
๐
2006
๐
ACM Press
๐
English
โ 130 KB
The Euclidean Steiner tree problem is to find the tree with minimal Euclidean length spanning a given fixed points in the plane, allowing the addition of auxiliary points known as Steiner points. Parallel implementations of local search algorithm are an effective technique to speed up the search for