Determining the Minimum Cost Steiner Tree for Delay Constrained Problems
We address a variant of the Steiner tree problem for delay constrained problems. The addressed problem consists in determining the minimum cost Steiner tree, while guaranteeing that the delay between any two terminal nodes does not exceed a given maximum value. This problem is known as the bounded d...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2021
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/96230 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/96230 |