Campus Event Calendar
Event Entry
New for: D3
What and Who
Partitioning Techniques for the Steiner Problem
Siavash Vahdati
Universität Mannheim
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 27 June 2001
13:30
45 Minutes
46
024
Saarbrücken
Abstract
The empirical strength of the state-of-the-art algorithms for some
NP-hard problems like the Steiner problem is the result of
combining many ingredients, playing together as an orchestra.
As an example for such an ingredient, in this talk we explain
how techniques based on partitioning can play an important role
in this context, particularly as reduction methods.
Contact
Siavash Vahdati Daneshmand
122
--email hidden
passcode not visible
logged in users only