English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper studies constructive heuristics for the minimum labelling spanningtree (MLST) problem. The purpose is to find a spanning tree that uses edgesthat are as similar as possible. Given an undirected labeled connected graph(i.e., with a label or color for each edge), the minimum labeling spanning treeproblem seeks a spanning tree whose edges have the smallest possible number ofdistinct labels. The model can represent many real-world problems intelecommunication networks, electric networks, and multimodal transportationnetworks, among others, and the problem has been shown to be NP-complete evenfor complete graphs. A primary heuristic, named the maximum vertex coveringalgorithm has been proposed. Several versions of this constructive heuristichave been proposed to improve its efficiency. Here we describe the problem,review the literature and compare some variants of this algorithm.

Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP