06061035

a

06061035 Berlakovich, Martin Ruthmair, Mario Raidl, G\"unther R. A multilevel heuristic for the rooted delay-constrained minimum spanning tree problem. Moreno-D{\'\i}az, Roberto (ed.) et al., Computer aided systems theory -- EUROCAST 2011. 13th international conference, Las Palmas de Gran Canaria, Spain, February 6--11, 2011. Revised selected papers, Part I. Berlin: Springer (ISBN 978-3-642-27548-7/pbk). Lecture Notes in Computer Science 6927, 256-263 (2012). 2012 Berlin: Springer EN

doi:10.1007/978-3-642-27549-4_33

Summary: The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem. The problem appears in practice for example when designing a distribution network with a guarantee of timely delivery. Another example is be a centralized broadcasting network where the delaybound represents a quality of service constraint. We introduce a multilevel-based construction heuristic which uses a new measurement for the suitability of edges to create a solution for the problem. In comparison to existing heuristics the main intention is not to create a minimum cost spanning tree, but a solution with a high potential for further improvement. Experimental results indicate that in most cases our approach produces solutions that after local improvement are of higher quality than those of other existing construction techniques.