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

Martin Berlakovich, Mario Ruthmair, Günther Raidl
January 2011
PDF bib

Abstract

Full Citation:

Martin Berlakovich, Mario Ruthmair, Günther R. Raidl. A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 247–249, 2011.

Type
Conference Paper
Hybrid Netdesign
Günther Raidl
Günther Raidl

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