Advanced search ?

Object

Download

Title: Extensions of the minimum labelling spanning tree problem, Journal of Telecommunications and Information Technology, 2006, nr 4

Creator:

Voß, Stefan ; Fink, Andreas ; Gentili, Monica ; Cerulli, Raffaele

Date:

2006, nr 4

Resource Type:

artykuł

Description:

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.

Publisher:

Instytut Łączności - Państwowy Instytut Badawczy, Warszawa

Format:

application/pdf

Resource Identifier:

oai:bc.itl.waw.pl:348

DOI:

10.26636/jtit.2006.4.396

ISSN:

1509-4553

eISSN:

1899-8852

Source:

Journal of Telecommunications and Information Technology

Language:

ang

Rights Management:

Biblioteka Naukowa Instytutu Łączności

Subject and keywords:

metaheuristics network design spanning trees labelling trees Steiner tree problem

Object collections:

Last modified:

Jun 24, 2024

In our library since:

Feb 25, 2010

Number of object content hits:

134

All available object's versions:

https://ribes-54.man.poznan.pl/publication/397

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

Edition name Date
Cerulli, Raffaele; Fink, Andreas; Gentili, Monica; Voß, Stefan, Extensions of the minimum labelling spanning tree problem, Journal of Telecommunications and Information Technology, 2006, nr 4 Jun 24, 2024

Objects Similar
Software tools for a multilayer network design, Journal of Telecommunications and Information Technology, 2005, nr 3

Voß, Stefan Höller, Holger

2005, nr 3
artykuł
Determining hop-constrained spanning trees with repetitive heuristics, Journal of Telecommunications and Information Technology, 2007, nr 4

Voß, Stefan Gouveia, Luis Fernandes, Manuela

2007, nr 4
artykuł
Developing a Ring-Based Optical Network Structure with Glass-Through Nodes, Journal of Telecommunications and Information Technology, 2012, nr 2

Voß, Stefan Caserta, Marco Schwarze, Silvia

2012, nr 2
artykuł
Requirements of 4G-Based Mobile Broadband on Future Transport Networks, Journal of Telecommunications and Information Technology, 2012, nr 2

Voß, Stefan Schwarze, Silvia Nitsch, Ralf Wevering,Stefan Fricke, Matthias Heckwolf, Andrea Herber, Ralf

2012, nr 2
artykuł
Designing WDM networks by a variable neighborhood search, Journal of Telecommunications and Information Technology, 2009, nr 4

Voß, Stefan Höller, Holger Melian-Batista, Belen

2006, nr 4
artykuł
Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem, Journal of Telecommunications and Information Technology, 2017, nr 4

Bereta, Michał

2017, nr 4
artykuł
Greedy randomised adaptive search procedures for topological design of MPLS networks, Journal of Telecommunications and Information Technology, 2002, nr 2

Mysłek, Andrzej

2002, nr 2
artykuł
Heuristic algorithms in topological design of telecommunication networks, Journal of Telecommunications and Information Technology, 2003, nr 3

Karaś, Piotr

2003, nr 3
artykuł
More
×

Citation

Citation style:

Contact details

Address

Instytut Łączności – Państwowy Instytut Badawczy ul. Szachowa 1 04-894 Warszawa

Phone

(+48) 5128 696

E-Mail

biblioteka@il-pib.pl

Visit us!

This page uses 'cookies'. More information