Add to ORKGGiven a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster. It is known that the GMST problem is NP-hard and even finding a near optimal solution is NP-hard. We give an approximation algorithm for the Generalized Minimum Spanning Tree problem in the case when the cluster size is bounded by $\rho$. In this case, the GMST problem can be approximated to within 2$\rho$
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum...
This article describes eight formulations for the generalized minimum spanning tree problem (gmstp)....
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMST...
Given an undirected graph whose nodes are partitioned into a number of clusters, the Generalized Min...
The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum ...
We consider a generalization of the minimum spanning tree problem, called the generalized minimum sp...
We present an overview of the approximation theory in combinatorial optimization. As an applicatio...
The generalized minimum spanning tree problem consists of designing a minimum cost tree spanning sev...
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (...
This paper is concerned with a special case of the Generalized Mini-mum Spanning Tree Problem. The G...
The generalized minimum spanning tree problem consists of finding a minimum cost spanning tree in an...
The Generalized Minimum Spanning Tree (GMST) problem requires spanning exactly one node from every c...
This paper is concerned with a special case of the generalized minimum spanning tree problem. The pr...
AbstractThe minimum vertex ranking spanning tree problem (MVRST) is to find a spanning tree of G who...
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum...
This article describes eight formulations for the generalized minimum spanning tree problem (gmstp)....
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMST...
Given an undirected graph whose nodes are partitioned into a number of clusters, the Generalized Min...
The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum ...
We consider a generalization of the minimum spanning tree problem, called the generalized minimum sp...
We present an overview of the approximation theory in combinatorial optimization. As an applicatio...
The generalized minimum spanning tree problem consists of designing a minimum cost tree spanning sev...
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (...
This paper is concerned with a special case of the Generalized Mini-mum Spanning Tree Problem. The G...
The generalized minimum spanning tree problem consists of finding a minimum cost spanning tree in an...
The Generalized Minimum Spanning Tree (GMST) problem requires spanning exactly one node from every c...
This paper is concerned with a special case of the generalized minimum spanning tree problem. The pr...
AbstractThe minimum vertex ranking spanning tree problem (MVRST) is to find a spanning tree of G who...
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum...
This article describes eight formulations for the generalized minimum spanning tree problem (gmstp)....
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...