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

Abstract

Full Citation:

Mario Ruthmair, Günther R. Raidl. A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 713–720, 2009, Springer.

Günther Raidl

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