Weighted Euclidean Steiner Trees for Disaster-Aware Network Design
We consider the problem of constructing a Euclidean Steiner tree in a setting where the plane has been divided into polygonal regions, each with an associated weight. Given a set of points (terminals), the task is to construct a shortest interconnection of the points, where the cost of a line segmen...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/87218 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/87218 |