A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
[chapter]
2009
Lecture Notes in Computer Science
The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present a construction heuristic based on Kruskal's algorithm for finding a minimum cost spanning tree which eliminates some drawbacks of existing heuristic methods. To improve the solution we introduce a greedy randomized adaptive search procedure (GRASP) and a
doi:10.1007/978-3-642-04772-5_92
fatcat:qvy4zigz5reidoi4yxf4acnxpi