A note on the minimum label spanning tree.
From MaRDI portal
Publication:1853118
DOI10.1016/S0020-0190(02)00230-2zbMath1042.68055OpenAlexW1997809628MaRDI QIDQ1853118
Yingyu Wan, Yinlong Xu, Guo-Liang Chen
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00230-2
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)
Related Items (17)
Greedy approximation for the minimum connected dominating set with labeling ⋮ Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem ⋮ Least and most colored bases ⋮ On the bicriterion - minimal cost/minimal label - spanning tree problem ⋮ Approximation algorithms and hardness results for labeled connectivity problems ⋮ The parameterized complexity of some minimum label problems ⋮ Solving the minimum label spanning tree problem by mathematical programming techniques ⋮ A hybrid metaheuristic for the minimum labeling spanning tree problem ⋮ Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems ⋮ Variable neighbourhood search for the minimum labelling Steiner tree problem ⋮ Algorithms and complexity for a class of combinatorial optimization problems with labelling ⋮ The labeled maximum matching problem ⋮ Local search for the minimum label spanning tree problem with bounded color classes. ⋮ A mixed integer linear formulation for the minimum label spanning tree problem ⋮ Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem ⋮ The labeled perfect matching in bipartite graphs ⋮ A polyhedral approach to the generalized minimum labeling spanning tree problem
Cites Work
This page was built for publication: A note on the minimum label spanning tree.
