Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Journal of Telecommunications and Information Technology

1 2006

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Steiner tree problem

Sortuj według:

Ogranicz wyniki do:

Extensions of the minimum labelling spanning tree problem

Cerulli R., Fink A., Gentili M., Voss S.

Journal of Telecommunications and Information Technology

2006

nr 4

39-45

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.