Abstract
This paper is concerned with a special case of the generalized minimum spanning tree problem. The problem is defined on an undirected graph, where the vertex set is partitioned into clusters, and non-negative costs are associated with the edges. The problem is to find a tree of minimum cost containing at least one vertex in each cluster. We consider a geometric case of the problem where the graph is complete, all vertices are situated in the plane, and Euclidean distance defines the edge cost. We prove that the problem is strongly \(\mathcal{NP}\)-hard even in the case of a special structure of the clustering called grid clustering. We construct an exact exponential time dynamic programming algorithm and, based on this dynamic programming algorithm, we develop a polynomial time approximation scheme for the problem with grid clustering.
Similar content being viewed by others
References
Duin CW, Volgenant A, Voß S (2004) Solving group steiner problems as Steiner problems. Euro J Oper Res 154:323–329
Feremans C (2001) Generalized spanning trees and extensions. Ph.D. thesis, Université Libre de Bruxelles
Feremans C, Labbé M, Laporte G (2003) Generalized network design problems. Euro J Oper Res 148:1–13
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of \(\mathcal{NP}\)-completeness. W. H. Freeman, New York
Myung YS, Lee CH, Tcha DW (1995) On the generalized minimum spanning tree problem. Networks 26:231–241
Pop PC (2002) The generalized minimum spanning tree problem. Ph.D. thesis, University of Twente
Pop PC (2004) New models of the GMST problem. J Math Modell Algorithms 3:153–166
Pop PC, Kern W, Still GJ (2005) An approximation algorithm for the GMST problem with bounded cluster size. In: Proccedings of the first ACiD workshop, Durham 2005. Texts Algorithms 4:115–121
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Feremans, C., Grigoriev, A. & Sitters, R. The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4, 319–329 (2006). https://doi.org/10.1007/s10288-006-0012-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-006-0012-6