Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
type: Item
instance of: scholarly article
title: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
zbMATH Open document ID: 1076.90050
author: Yupei Xiong
author: Edward Wasil
author: Bruce Golden
published in: Operations Research Letters
publication date: 2004-11-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2116854
zbMATH Keywords: Algorithm
zbMATH Keywords: NP-hard
zbMATH Keywords: Spanning trees
zbMATH Keywords: Linear programming
MaRDI profile type: Publication
full work available at URL: j.orl.2004.03.004
OpenAlex ID: W1998751027
cites work: Local search for the minimum label spanning tree problem with bounded color classes.
cites work: The minimum labeling spanning trees
cites work: On the minimum label spanning tree problem
cites work: A note on the minimum label spanning tree.
DOI: 10.1016/J.ORL.2004.03.004
Recommended article: On the minimum label spanning tree problem
Recommended article: A hybrid metaheuristic for the minimum labeling spanning tree problem
Recommended article: A polyhedral approach to the generalized minimum labeling spanning tree problem
Recommended article: Heuristics for the multi-level capacitated minimum spanning tree problem
Recommended article: Q4949834
Recommended article: Greedy heuristics for the diameter-constrained minimum spanning tree problem
Recommended article: A mixed integer linear formulation for the minimum label spanning tree problem
Recommended article: Greedy heuristics for the bounded diameter minimum spanning tree problem
Recommended article: On the bicriterion - minimal cost/minimal label - spanning tree problem
description: scientific article; zbMATH DE number 2116854