A NOTE ON THE COMPLEXITY OF THE GENERALIZED MINIMUM SPANNING TREE PROBLEM

We consider the Generalized Minimum Spanning Tree Problem denoted by GMST. It is known that the GMST problem is NP-hard. We present a stronger result regarding the complexity of the problem, namely, the GMST problem even on trees is NP-hard. As well as we present three cases when the GMST problem is solvable in polynomial time.

[1]  Petrica C. Pop,et al.  An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size , 2005, ACiD.

[2]  John J. Prisco,et al.  Fiber Optic Regional Area Networks in New York and Dallas , 1986, IEEE J. Sel. Areas Commun..

[3]  Luigi Fratta,et al.  Tree structured fiber optics MANs , 1988, IEEE J. Sel. Areas Commun..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Petrica C. Pop,et al.  A new relaxation method for the generalized minimum spanning tree problem , 2006, Eur. J. Oper. Res..

[6]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[7]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[8]  Moshe Dror,et al.  Generalized spanning trees , 2000, Eur. J. Oper. Res..

[9]  Young-Soo Myung,et al.  On the generalized minimum spanning tree problem , 1995, Networks.

[10]  P. Pop.  The generalized minimum spanning tree problem , 2000 .

[11]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[12]  Gilbert Laporte,et al.  A comparative analysis of several formulations for the generalized minimum spanning tree problem , 2002, Networks.

[13]  Corinne Feremans.  Generalized Spanning Trees and Extensions , 2001 .

[14]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .