A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Rashid Bin Muhammad

Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)

Las Vegas, Nevada

June 19-June 20

ISBN: 0-7695-2611-X

	ASCII Text	x
	Rashid Bin Muhammad, "A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem," Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on, pp. 157-164, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), 2006.

	BibTex	x
	@article{ 10.1109/SNPD-SAWN.2006.7, author = {Rashid Bin Muhammad}, title = {A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem}, journal ={Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on}, volume = {0}, year = {2006}, isbn = {0-7695-2611-X}, pages = {157-164}, doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD-SAWN.2006.7}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on TI - A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem SN - 0-7695-2611-X SP157 EP164 A1 - Rashid Bin Muhammad, PY - 2006 KW - null VL - 0 JA - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on ER -

Rashid Bin Muhammad, Kent State University, OH

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD-SAWN.2006.7

This paper presented a parallel local search algorithm for the Steiner tree problem. The main contribution of this work is the o(n^2 \log^2 n+\log n(\frac{n}{{\log n}})) parallel local search algorithm for computing Steiner tree on the Euclidean plane. The algorithmused proximity structures from computational geometry like, Voronoi diagram, Delaunay triangulation, Gabriel graph, and relative neighborhood graphs to compute additional or Steiner points.

Citation:

Rashid Bin Muhammad, "A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem," snpd-sawn, pp.157-164, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.