arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.1980cs.DMmath.CO
收藏

对MLSTP建筑材料的探索和开发

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

Sergio Consoli, Jose Andres Moreno-Perez, Kenneth Darby-Dowman, Nenad Mladenovic

摘要:

研究了最小标号生成树问题的构造性算法。目的是找到一个生成树,使用尽可能相似的边。给定一个无向标记连通图(即,对于每条边具有标签或颜色),最小标记生成树问题寻找其边具有最小可能数量的不同标签的生成树。该模型可以代表电信网络、电力网络和多式联运网络等领域的许多现实问题,并且即使对于完整图,该问题也已被证明是NP完全的。提出了一种新的启发式算法,称为最大顶点覆盖算法。已经提出了几个版本的这种建设性的启发式,以提高其效率。在这里,我们描述的问题,回顾文献和比较这个算法的一些变种。

英文摘要:

This paper studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that 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 tree problem seeks a spanning tree whose edges have the smallest possible number of distinct labels. The model can represent many real-world problems in telecommunication networks, electric networks, and multimodal transportation networks, among others, and the problem has been shown to be NP-complete even for complete graphs. A primary heuristic, named the maximum vertex covering algorithm has been proposed. Several versions of this constructive heuristic have been proposed to improve its efficiency. Here we describe the problem, review the literature and compare some variants of this algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑