The Budgeted Labeled Minimum Spanning Tree Problem
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs. The earliest setting addressed in the literature aims to minimize the number of different media types, i.e., distinct labels, used in the...
Principais autores: | Raffaele Cerulli, Ciriaco D'Ambrosio, Domenico Serra, Carmine Sorgente |
---|---|
Formato: | Artigo |
Idioma: | English |
Publicado em: |
MDPI AG
2024-01-01
|
coleção: | Mathematics |
Assuntos: | |
Acesso em linha: | https://www.mdpi.com/2227-7390/12/2/230 |
Registros relacionados
-
Extensions of the minimum labelling spanning tree problem
por: Raffaele Cerulli, et al.
Publicado em: (2006-12-01) -
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
por: Petrică C. Pop, et al.
Publicado em: (2006-02-01) -
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
por: Petrică C. Pop, et al.
Publicado em: (2006-02-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
por: Alexander Valeryevich Smirnov
Publicado em: (2021-03-01) -
The Spanning Tree of a Divisible Multiple Graph
por: Alexander V. Smirnov
Publicado em: (2018-08-01)