Abstract
We consider a natural generalization of the classical minimum spanning tree problem called Minimum Spanning Tree with Neighborhoods (MSTN) which seeks a tree of minimum length to span a set of 2D regions called neighborhoods. Each neighborhood contributes exact one node to the tree, and the MSTN has the minimum total length among all possible trees spanning the set of nodes. We prove the NP-hardness of this problem for the case in which the neighborhoods are a set of disjoint discs and rectangles. When the regions considered are a set of disjoint 2D unit discs, we present the following approximation results: (1) A simple algorithm that achieves an approximation ratio of 7.4; (2) Lower bounds and two 3-approximation algorithms; (3) A PTAS for this problem. Our algorithms can be easily generalized to higher dimensions.
The research of this work was supported in part by an NSF CARRER Award CCF-0546509.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Har-Peled, S.: A replacement for voronoi diagrams of near linear size. In: FOCS, pp. 94–103 (2001)
Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate voronoi diagrams. In: STOC ’02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, Montreal, Quebec, Canada, pp. 721–730. ACM Press, New York (2002), doi:10.1145/509907.510011
Wei, X., Samarabandu, J., Devdhar, R., Siegel, A., Acharya, R., Berezney, R.: Segregation of transcription and replication sites into higher order domains
Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics 55(3), 197–218 (1994)
Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In: Symposium on Computational Geometry, pp. 360–369 (1995)
Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for tsp with neighborhoods. Nord. J. Comput. 6(4), 469–488 (1999)
Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for tsp with neighborhoods in the plane. In: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 38–46. ACM Press, New York (2001)
de Berg, M., Gudmundsson, J., Katz, M., Levcopoulos, C., Overmars, M., van der Stappen, F.: Constant factor approximation algorithms for tspn with fat objects
Mitchell, J.S.B.: A ptas for tsp with neighborhoods among fat regions in the plane. In: ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York (2007)
Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
Mansfield, A.: Determining the thickness of graphs is np-hard. Math. Proc. Cambridge Philos. Soc., 9–23 (1983)
Arora, S.: Polynomial time approximation schemes for euclidean TSP and other geometric problems. In: FOCS, pp. 2–11 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yang, Y., Lin, M., Xu, J., Xie, Y. (2007). Minimum Spanning Tree with Neighborhoods. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72870-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-72870-2_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72868-9
Online ISBN: 978-3-540-72870-2
eBook Packages: Computer ScienceComputer Science (R0)