Abstract
Given a connected, weighted, undirected graph G=(V,E) and a constant D≥2, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of minimum weight with diameter no more than D. A new algorithm addresses graphs with non-negative weights and has proven performance ratio of O1−Ddmin(|V|−1)w+/w−+1, where w+ (resp. w−) denotes the maximum (resp. minimum) edge weight in the graph, and dmin is the hop diameter of G. The running time of the algorithm is O|V|logD after minimum spanning tree of G is computed. The performance of the algorithm has been evaluated empirically as well.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
