Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm

We present an exact algorithm for solving the generalized minimum spanning tree problem (GMST). Given an undirected connected graph and a partition of the graph vertices, this problem requires finding a least-cost subgraph spanning at least one vertex out of every subset. In this paper, the GMST is formulated as a minimum spanning tree problem with side constraints and solved exactly by a branch-and-bound algorithm. Lower bounds are derived by relaxing, in a Lagrangian fashion, complicating constraints to yield a modified minimum cost spanning tree problem. An efficient preprocessing algorithm is implemented to reduce the size of the problem. Computational tests on a large set of randomly generated instances with as many as 250 vertices, 1000 edges, and 25 subsets provide evidence that the proposed solution approach is very effective.

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

[2]  Gilbert Laporte,et al.  On generalized minimum spanning trees , 2001, Eur. J. Oper. Res..

[3]  Salvatore Torquato,et al.  Globally and locally minimal weight spanning tree networks , 2001 .

[4]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

[5]  Edmund Ihler,et al.  Class Steiner Trees and VLSI-design , 1999, Discret. Appl. Math..

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

[7]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[8]  Bertrand M. T. Lin,et al.  Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem , 2003, J. Exp. Theor. Artif. Intell..

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

[10]  Edmund Ihler,et al.  The Complexity of Approximating the Class Steiner Tree Problem , 1991, WG.

[11]  Mohamed Haouari,et al.  Upper and lower bounding strategies for the generalized minimum spanning tree problem , 2006, Eur. J. Oper. Res..

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

[13]  Alex Zelikovsky,et al.  An improved approximation scheme for the Group Steiner Problem , 2001, Networks.

[14]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

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

[16]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[17]  Gabriele Reich,et al.  Beyond Steiner's Problem: A VLSI Oriented Generalization , 1989, WG.