Computing Euclidean Steiner trees over segments
In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2020
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/ee617a60c16d4bb7b8c24ee88dd45a69 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|