Generalized spanning trees

Abstract In this paper, we propose a definition for the Generalized Minimal Spanning Tree (GMST) of a graph. The GMST requires spanning at least one node out of every set of disjoint nodes (node partition) in a graph. The analysis of the GMST problem is motivated by real life agricultural settings related to construction of irrigation networks in desert environments. We prove that the GMST problem is NP-hard, and examine a number of heuristic solutions for this problem. Computational experiments comparing these heuristics are presented.

[1]  Ján Plesník.  Heuristics for the Steiner Problem in Graphs , 1992, Discret. Appl. Math..

[2]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

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

[4]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[5]  M. Minoux.  Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity , 1990 .

[6]  Ernest S. Kuh,et al.  VLSI circuit layout : theory and design , 1985 .

[7]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[8]  Stefan Voß,et al.  Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

[9]  L. Wolsey,et al.  Chapter 9 Optimal trees , 1995 .

[10]  Thomas L. Magnanti,et al.  A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs , 1990, Oper. Res..

[11]  Michel X. Goemans,et al.  Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

[14]  M. Dror,et al.  Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms , 1990 .

[15]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

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

[17]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

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

[19]  Bezalel Gavish,et al.  Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[20]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

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

[22]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[23]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..