The Budgeted Labeled Minimum Spanning Tree Problem

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...

Olles dieđut

Bibliográfalaš dieđut
Váldodahkkit: Raffaele Cerulli, Ciriaco D'Ambrosio, Domenico Serra, Carmine Sorgente
Materiálatiipa: Artihkal
Giella:English
Almmustuhtton: MDPI AG 2024-01-01
Ráidu:Mathematics
Fáttát:
network design
minimum spanning tree
labeled graphs
integer linear programming
Liŋkkat:https://www.mdpi.com/2227-7390/12/2/230

Interneahtta

https://www.mdpi.com/2227-7390/12/2/230

Geahča maid