Share Your Research, Maximize Your Social Impacts
A New Heuristic Constructing Minimal Steiner Trees inside Simple Polygons
Journal: Advances in Computer Science : an International Journal(ACSIJ) (Vol.2, No. 3)Publication Date: 2013-07-31
Authors : Alireza Khosravinejad; Alireza Bagheri; Vahid Khosravinejad;
Page : 122-125
Keywords : Euclidean Steiner Minimal Tree; Delaunay triangulation; geodesic convex hull;
Source : Download
Find it from : Google Scholar
Abstract
The Steiner tree problem has numerous applications in urban transportation network, design of electronic integrated circuits, and computer network routing. This problem aims at finding a minimum Steiner tree in the Euclidean space, the distance between ea ...
Other Latest Articles
- A New Heuristic Algorithm for Constructing Steiner Trees inside Simple polygons in Presence of Obstacles
- Watchdog-LEACH: A new method based on LEACH protocol to Secure Clustered Wireless Sensor Networks
- A New Approach for Labeling Images Using CAPTCHA in Image Semantic Search Engines
- USE OF E-LEARNING TOOLS TO SOLVE GROUP WORK PROBLEMS IN HIGHER EDUCATION: A CASE STUDY OF GULF COUNTRY
- Designing a Clustering and Prediction-based Protocol for Target Tracking in Wireless Sensor Networks (WSNs)
Last modified: 2014-02-03 22:12:39