- Tytuł:
- Extensions of the minimum labelling spanning tree problem
- Autorzy:
-
Cerulli, R.
Fink, A.
Gentili, M.
Voss, S. - Powiązania:
- https://bibliotekanauki.pl/articles/308930.pdf
- Data publikacji:
- 2006
- Wydawca:
- Instytut Łączności - Państwowy Instytut Badawczy
- Tematy:
-
network design
metaheuristics
spanning trees
labelling trees
Steiner tree problem - Opis:
- In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected subgraph of G with the minimum number of different colors covering all the basic vertices. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by means of homogeneous connections. Numerical results for several metaheuristics to solve the problem are presented.
- Źródło:
-
Journal of Telecommunications and Information Technology; 2006, 4; 39-45
1509-4553
1899-8852 - Pojawia się w:
- Journal of Telecommunications and Information Technology
- Dostawca treści:
- Biblioteka Nauki
Artykuł