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

Mario Ruthmair, Günther Raidl
January 2009
PDF bib

Abstract

Full Citation:

Mario Ruthmair, Günther R. Raidl. A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia and others), pages 244-246, 2009.

Type
Conference Paper
Grasp Netdesign VND
Günther Raidl
Günther Raidl

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