Cargando…
An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length
We present improved algorithms for the Steiner tree problem with the minimum number of Steiner points and bounded edge length. Given n terminal points in a 2D Euclidean plane and an edge length bound, the problem asks to construct a spanning tree of n terminal points with minimal Steiner points such...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10662762/ https://www.ncbi.nlm.nih.gov/pubmed/37988376 http://dx.doi.org/10.1371/journal.pone.0294353 |