A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Abstract

Full Citation:

Martin Berlakovich, Mario Ruthmair, Günther R. Raidl. A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 256–263, 2012, Springer.

Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.