- Tytuł:
- Determining hop-constrained spanning trees with repetitive heuristics
- Autorzy:
-
Fernandes, M.
Gouveia, L.
Voß, S. - Powiązania:
- https://bibliotekanauki.pl/articles/308588.pdf
- Data publikacji:
- 2007
- Wydawca:
- Instytut Łączności - Państwowy Instytut Badawczy
- Tematy:
-
hop-constrained spanning tree problem
metaheuristics
pilot method
rollout method - Opis:
- The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges. This problem relates to the design of centralized tree networks with quality of service requirements (in telecommunications) and has a close relation with other tree problems. In this paper we investigate the adaptation of some well-known "repetitive" heuristics used for the capacitated minimum spanning tree problem to the hop-constrained minimum spanning tree problem and investigate some simple look ahead mechanisms for enhancing the quality of a savings heuristic. Computational results for a set of benchmark tests with up to 80 nodes are presented.
- Źródło:
-
Journal of Telecommunications and Information Technology; 2007, 4; 16-22
1509-4553
1899-8852 - Pojawia się w:
- Journal of Telecommunications and Information Technology
- Dostawca treści:
- Biblioteka Nauki
Artykuł