Campus Event Calendar
Event Entry
What and Who
The Bidirected Cut Relaxation for the Steiner Tree Problem
V.S.Anil Kumar
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (others' work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 4 December 2000
13:30
30 Minutes
024
Saarbrücken
Abstract
The Steiner tree problem, and its generalizations are some
of the most important network design problems.
I will describe the work of Rajagopalan and Vazirani,
which is the first attempt towards analysing the
bidirected cut relaxation using a primal-dual scheme.
Contact
V.S.Anil Kumar
--email hidden
passcode not visible
logged in users only