Results 1  10
of
431,255
In the Minimum Label Spanning Tree problem
, 2002
"... www.elsevier.com/locate/dsw Local search for the minimum label spanning tree problem with bounded color classes ..."
Abstract
 Add to MetaCart
www.elsevier.com/locate/dsw Local search for the minimum label spanning tree problem with bounded color classes
Local search for the minimum label spanning tree problem with bounded color classes
, 2003
"... In the Minimum Label Spanning Tree problem ..."
On The Minimum Label Spanning Tree Problem
 Information Processing Letters
, 1998
"... . We study the Minimum Label Spanning Tree Problem. In this problem, we are given an undirected graph whose edges are labeled with colors. The goal is to nd a spanning tree which uses as least dierent colors as possible. We present an approximation algorithm with logarithmic performance guarant ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
. We study the Minimum Label Spanning Tree Problem. In this problem, we are given an undirected graph whose edges are labeled with colors. The goal is to nd a spanning tree which uses as least dierent colors as possible. We present an approximation algorithm with logarithmic performance
Extensions of the Minimum Labelling Spanning Tree Problem
, 2005
"... In this paper we propose some extensions of the Minimum Labelling Spanning Tree Problem (MLST). The main focus is on the Minimum Labelling Steiner Tree Problem: Given a graph G with a color (label) assigned to each edge (not necessarily properly), and a subset Q of nodes of G (basic vertices), we lo ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
In this paper we propose some extensions of the Minimum Labelling Spanning Tree Problem (MLST). The main focus is on the Minimum Labelling Steiner Tree Problem: Given a graph G with a color (label) assigned to each edge (not necessarily properly), and a subset Q of nodes of G (basic vertices), we
Paper Extensions of the minimum labelling spanning tree problem
"... Abstract — In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected ..."
Abstract
 Add to MetaCart
Abstract — In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected
Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison
, 2006
"... This report 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 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report 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
An Effective Genetic Algorithm for the MinimumLabel Spanning Tree Problem
"... Given a connected, undirected graph G with labeled edges, the minimumlabel spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible number of labels. A greedy heuristic for this NPhard problem greedily chooses labels so as to reduce the number of component ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Given a connected, undirected graph G with labeled edges, the minimumlabel spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible number of labels. A greedy heuristic for this NPhard problem greedily chooses labels so as to reduce the number
Greedy Heuristics and Evolutionary Algorithms for the Bounded MinimumLabel Spanning Tree Problem
"... Given an edgelabeled, connected, undirected graph G and a bound r> 1, the bounded minimumlabel spanning tree problem seeks a spanning tree on G whose edges carry the fewest possible labels and in which no label appears more than r times. Two greedy heuristics for the unbounded version of the pr ..."
Abstract
 Add to MetaCart
Given an edgelabeled, connected, undirected graph G and a bound r> 1, the bounded minimumlabel spanning tree problem seeks a spanning tree on G whose edges carry the fewest possible labels and in which no label appears more than r times. Two greedy heuristics for the unbounded version
Performance Analysis on Evolutionary Algorithms for the Minimum Label Spanning Tree Problem
, 2014
"... Some experimental investigations have shown that evolutionary algorithms (EAs) are efficient for the minimum label spanning tree (MLST) problem. However, we know little about that in theory. As one step towards this issue, we theoretically analyze the performances of the (1+1) EA, a simple version o ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Some experimental investigations have shown that evolutionary algorithms (EAs) are efficient for the minimum label spanning tree (MLST) problem. However, we know little about that in theory. As one step towards this issue, we theoretically analyze the performances of the (1+1) EA, a simple version
Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem
 MIC 2007: THE SEVENTH METAHEURISTICS INTERNATIONAL CONFERENCE
, 2007
"... ..."
Results 1  10
of
431,255