Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem

Authors

  • C. Patvardhan
  • V. Prem Prakash
  • A. Srivastav

Abstract

Given a connected, undirected graph G = (V, E) on n = jV j vertices, an integer bound D>=2 and non-zero edge weights associated with each edge e 2 E, a bounded diameter minimum spanning tree (BDMST) on G is defined as a spanning tree T E on G of minimum edge cost w(T) = P w(e), 8 e 2 T and tree diameter no greater than D. The Euclidean BDMST Problem aims to find the minimum cost BDMST on graphs whose vertices are points in Euclidean space and whose edge weights are the Euclidean distances between the corresponding vertices. The problem of computing BDMSTs is known to be NP-Hard for 4 D n -1, where D the diameter bound. Furthermore, the problem is known to be hard to approximate. Heuristics are extant in the literature which build low cost, diameter-constrained spanning trees in O(n3) time. This paper presents some fast and effective heuristic strategies for the Euclidean BDMST Problem and compares their performance with that of the best known existing heuristics. Two of the proposed heuristics run in O(n2pn) time and another faster heuristic runs in O(n2), thereby allowing them to quickly build low cost BDSTs on larger sized problems than have been attempted hitherto. The proposed heuristics are shown to perform better over a wide range of benchmark instances used in the literature for the Euclidean BDMST Problem. Further, a new test suite of much larger problem sizes than attempted hitherto in the literature is designed and results presented.
Vol. 39, No.3

Downloads

How to Cite

Patvardhan, C. ., Prakash, V. . . . . P. ., & Srivastav, A. . . . . . (2015). Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. Informatica, 39(3). Retrieved from https://puffbird.ijs.si/index.php/informatica/article/view/984

Issue

Vol. 39 No. 3 (2015)

Section

Regular papers

License

I assign to Informatica, An International Journal of Computing and Informatics ("Journal") the copyright in the manuscript identified above and any additional material (figures, tables, illustrations, software or other information intended for publication) submitted as part of or as a supplement to the manuscript ("Paper") in all forms and media throughout the world, in all languages, for the full term of copyright, effective when and if the article is accepted for publication. This transfer includes the right to reproduce and/or to distribute the Paper to other journals or digital libraries in electronic and online forms and systems.

I understand that I retain the rights to use the pre-prints, off-prints, accepted manuscript and published journal Paper for personal use, scholarly purposes and internal institutional use.

In certain cases, I can ask for retaining the publishing rights of the Paper. The Journal can permit or deny the request for publishing rights, to which I fully agree.

I declare that the submitted Paper is original, has been written by the stated authors and has not been published elsewhere nor is currently being considered for publication by any other journal and will not be submitted for such review while under review by this Journal.  The Paper contains no material that violates proprietary rights of any other person or entity. I have obtained written permission from copyright owners for any excerpts from copyrighted works that are included and have credited the sources in my article. I have informed the co-author(s) of the terms of this publishing agreement.


Copyright ©  Slovenian Society Informatika