An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F07%3APU71534" target="_blank" >RIV/00216305:26210/07:PU71534 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem
Original language description
The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem being NP-hard, polynomial-time approximations or heuristics are required. There are many rather complex heuristics based, e.g., on enumerating full topologies and consuming long time for computations for large instances. In this paper, we applied to use tools of computational geometry, especially the properties of Delaunay triangulation, a well-known geometric structure, and combine them with insertion heuristics based on the construction of the Euclidean minimum spanning tree. Thus an algorithm could be proposed that is very efficient and fast. Experiments confirmed that computations by this algorithm generate very good results in a reasonable amount of time, even for large instances of the studied problem.
Czech name
—
Czech description
—

Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Book/collection name
Katalinic, B. (ed.): DAAAM International Scientific Book 2007
ISBN
3-901509-60-7
Number of pages of the result
12
Pages from-to
—
Number of pages of the book
686
Publisher name
DAAAM International
Place of publication
Wien (Austria)
UT code for WoS chapter
—

Similar results(10)