A New 0--1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl
January 2005
PDF bib

Abstract

Full Citation:

Martin Gruber, Günther R. Raidl. A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem. Proceedings of the 2nd International Network Optimization Conference 2005 (L Gouveia and C. Mour~ao), pages 178-185, 2005.

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

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