A parallel local search algorithm for Euclidean Steiner tree problem

Proc. - Seventh ACIS Int. Conf. on Software Eng., Artific. Intelligence, Netw., and Parallel/Distributed Comput., SNPD 2006, including Second ACIS Int. Worshop on SAWN 2006

Volumn 2006, Issue , 2006, Pages 157-162

  Muhammad, Rashid Bin ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; GRAPHIC METHODS;

DELAUNAY TRIANGULATION; GABRIEL GRAPH; STEINER TREE PROBLEM; VORONOI DIAGRAM;

TREES (MATHEMATICS);

EID: 33845589778     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SNPD-SAWN.2006.7     Document Type: Conference Paper

References (17)

1. E. Aarts and J. K. Lenstra, Local Search in Combinatorial Optimization, Princeton University Press, Princeton, New Jersey, (2003).
2. T. A. Feo and M. G. C. Resende, "A probabilistic heuristic for computationally difficult set covering problem," Operations Research Letters, (8):67-71, 1989.
3. T. A. Feo and M. G. C. Resende, "Greedy randomized adaptive search procedures," Journal of Global Optimization, (6):109-133, 1995.
4. S. L. Martins, M. G. C. Resende, C. C. Ribeiro, and P. Pardalos, "A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy," Journal of Global Optimization, (17):267-283, 2000.
5. K. Mehlhorn, "A faster approximation for the Steiner problem in graphs," Information Processing Letters, (27): 125-128, 1988.
6. S. L. Martins, C. C. Ribeiro, and M. C. Souza, "A parallel GRASP for the Steiner problem in graphs," Lecture Notes in Computer Science, Vol.1457:pp.285-297, Springer-Verlag, Berlin Heidelberg, 1998.
7. S. A. Canuto, "Local search for the prize-Collecting Steiner tee problem," M.Sc. Dissertation, Department of Computer Science, Catholic University of Rio de Janeiro, 2000.
8. S. A. Canuto, M. G. C. Resende, and C. C. Ribeiro, "Local search with perturbations for the prize-collecting Steiner tree problem in graphs," Networks, (38):50-58, 2001.
9. Y. Handa, H. Ono, K. Sadakane, and M. Yamashita, "Neighborhood composition: A parallelization of local search algorithms," Lecture Notes in Computer Science, Vol.3241:155-163, Springer-Verlag, Berlin Heidelberg, 2004.
10. M. Zachariasen and P. Winter, "Concatenation-based greedy heuristics for the Steiner tree problem in the Euclidean plane," Algorithmica, (25):418-437, 1999.
11. R. Muhammad, "Parallelization of local search for Euclidean Steiner tree problem," Proceedings of The 44th ACM Southeast Conference (ACMSE 2006), Melbourne, Florida, USA, 2006.
12. D. T. Lee, "On k-nearest neighbor Voronoi Diagrams in the plane," IEEE Transactions on Computers, C-31(6):478-487, 1982.
13. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1988.
14. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, Annals of Discrete Mathematics, North-Holland, Amsterdam, 1992.
15. M. Zachariasen and P. Winter, "Concatenation-based greedy heuristics for the Steiner tree problem in the Euclidean plane," Technical Report 97/20, DIKU, Department of Computer Science, University of Copenhagen, 1997.
16. C. P. Kruskal, L. Rudolph, and M. Snir, "A complexity theory of efficient parallel algorithms," Theoretical Computer Science, (71):95-132, 1990.
17. D. T. Lotarev, A. V. Suprun, and A. P. Uzdemir, "Local optimization in the Steiner problem on the Euclidean plane," Automation and Remote Control, 65(7): 1089-1098, 2004.