Abstract
Given a connected, weighted, undirected graph G with n vertices and a positive integer bound D, the problem of computing the lowest cost spanning tree from amongst all spanning trees of the graph containing paths with at most D edges is known to be NP-Hard for 4 ≤ D < n-1. This is termed as the Diameter Constrained, or Bounded Diameter Minimum Spanning Tree Problem (BDMST). A well known greedy heuristic for this problem is based on Prim’s algorithm, and computes BDMSTs in O(n4) time. A modified version of this heuristic using a tree-center based approach runs an order faster. A greedy randomized heuristic for the problem runs in O(n3) time and produces better (lower cost) spanning trees on Euclidean benchmark problem instances when the diameter bound is small. This paper presents two novel heuristics that compute low cost diameter-constrained spanning trees in O(n3) and O(n2) time respectively. The performance of these heuristics vis-à-vis the extant heuristics is shown to be better on a wide range of Euclidean benchmark instances used in the literature for the BDMST Problem.
Chapter PDF
Similar content being viewed by others
References
Abdalla, A., Deo, N., Gupta, P.: Random-tree Diameter and the diameter constrained MST. In: Congressus Numerantium, vol. 144, pp. 161–182. Utilitas Mathematica (2000)
Bala, K., Petropoulos, K., Stern, T.E.: Multicasting in a linear lightwave network. In: IEEE INFOCOM 1993, pp. 1350–1358 (1993)
Bookstein, A., Klein, S.T.: Compression of correlated bit-vectors. Information Systems 16(4), 110–118 (1996)
Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems 7(1), 61–77 (1989)
Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Kortsarz, G., Peleg, D.: Approximating shallow-light trees. In: Proc. Eighth ACM-SIAM Symposium on Discrete Algorithms, pp. 103–110 (1997)
Julstrom, B.A., Raidl, G.R.: A permutation-coded EA for the BDMST problem. In: GECCO 2003 Workshops Proc., Workshop on Analysis & Design of Representations, pp. 2–7 (2003)
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)
Julstrom, B.A.: Greedy Heuristics for the Bounded Diameter Minimum Spanning Tree Problem. ACM J. Exp. Algor. 14, Article 1.1 (2009)
Achuthan, N.R., Caccetta, L., Cacetta, P., Geelen, J.F.: Algorithms for the minimum weight spanning tree with bounded diameter problem. Optimization: Techniques and Applications, 297–304 (1992)
Singh, A., Gupta, A.K.: Improved heuristics for the bounded diameter minimum spanning tree problem. Soft Computing 11(10), 911–921 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patvardhan, C., Prakash, V.P. (2009). Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter. In: Chaudhury, S., Mitra, S., Murthy, C.A., Sastry, P.S., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2009. Lecture Notes in Computer Science, vol 5909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11164-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-11164-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11163-1
Online ISBN: 978-3-642-11164-8
eBook Packages: Computer ScienceComputer Science (R0)