People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem
Martin Gruber
,
Günther Raidl
January 2008
PDF
Cite
Type
Conference Paper
Hybrid
Mip
Netdesign
Günther Raidl
Günther Raidl is a Professor at the Algorithms and Complexity Group.
Cite
×