Computational geometry: an introduction
Computational geometry: an introduction
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet
Future Generation Computer Systems - Special issue: Bio-inspired solutions to parallel processing problems
A parallel adaptive tabu search approach
Parallel Computing
Performance evaluation of a parallel tabu search task scheduling algorithm
Parallel Computing - High performance computing in operations research
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy
Journal of Global Optimization
A Parallel GRASP for the Steiner Problem in Graphs
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
A Parallel Genetic Programming Tool Based on PVM
Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Local Optimization in the Steiner Problem on the Euclidean Plane
Automation and Remote Control
Range assignment problem on the Steiner tree based topology in ad hoc wireless networks
Mobile Information Systems - Advances in Wireless Networks
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |
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 a solution of Steiner tree problem. This technique not only allows to solve larger Steiner tree problem or to find improved solutions with respect to their sequential counterparts, but also it leads to further robustness in the algorithm. In this paper, we concentrate on the problem of finding a Euclidean Steiner tree using parallel local search technique. The main contribution of this work is the O(n2 log2 n+log n log(n/log n)) parallel local search algorithm for computing Steiner tree on the Euclidean plane. The main advantage of the algorithm is that it does not need synchronization. As a result, it has no communication overhead.