Evolutionary Approach to the Euclidean Steiner Tree Problem in n-Space
This article presents the application of a genetic algorithm for solving the Euclidean Steiner problem in spaces of dimensionality greater than 2. The Euclidean Steiner problem involves finding the minimum spanning network that connects a given set of vertices, including the additional Steiner verti...
Saved in:
| Main Author: | Michał Bereta |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/3/1413 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Steiner eccentricity: Predictions and applications
by: Xingfu Li, et al.
Published: (2025-09-01) -
Degree-Constrained Steiner Problem in Graphs with Capacity Constraints
by: Miklos Molnar
Published: (2024-11-01) -
An <i>O</i>(<i>kn</i>)-Time Algorithm to Solve Steiner (<i>k</i>, <i>k</i>′)-Eccentricity on Trees
by: Xingfu Li
Published: (2025-02-01) -
Harigeeta: Cic Mechanism with Euclidean Steiner Tree for Service Latency Prediction in Delay-Sensitive Cloud Services
by: Rahul Kumar Sharma, et al.
Published: (2024-12-01) -
Hybrid GRASP heuristics for the phylogeny problem combining path-relinking and genetic algorithm as an intensification strategy
by: Dalessandro Soares Vianna, et al.
Published: (2014-09-01)