This publication is unavailable to your account. If you have more privileged account please try to use it or contact with the institution connected to this digital library.
Voß, Stefan ; Gouveia, Luis ; Fernandes, Manuela
2007, nr 4
artykuł
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.
Instytut Łączności - Państwowy Instytut Badawczy, Warszawa
application/pdf
oai:bc.itl.waw.pl:301
10.26636/jtit.2007.4.846
1509-4553
1899-8852
Journal of Telecommunications and Information Technology
ang
Biblioteka Naukowa Instytutu Łączności
Jul 30, 2024
Jan 29, 2010
160
https://bc.itl.waw.pl/publication/345
RDF
OAI-PMH
Voß, Stefan Fink, Andreas Gentili, Monica Cerulli, Raffaele
Voß, Stefan Höller, Holger
Voß, Stefan Shi, Xiaoning
Voß, Stefan Höller, Holger Melian-Batista, Belen
Voß, Stefan Caserta, Marco Schwarze, Silvia
Voß, Stefan Schwarze, Silvia Nitsch, Ralf Wevering,Stefan Fricke, Matthias Heckwolf, Andrea Herber, Ralf
Citation style: Chicago ISO690 Chicago
This page uses 'cookies'. More information I understand