Campus Event Calendar
Event Entry
What and Who
Steiner Trees in Networks
Tobias Polzin
Universität Mannheim
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 16 March 2001
13:30
30 Minutes
46
021
Saarbrücken
Abstract
In this talk we give a description of the problem and
the algorithms for computing lower and upper bound, with
a special focus on reduction techniques.
We will show some recent developments and point out
the most important open questions in this field.
Contact
Tobias Polzin
122
--email hidden
passcode not visible
logged in users only