Campus Event Calendar
Event Entry
What and Who
Approximation algorithms reading group
Rajiv Raman
Max-Planck-Institut für Informatik - D1
Lecture
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 24 January 2008
14:30
-- Not specified --
E1 4
Rotunda 3rd floor
Saarbrücken
Abstract
Packing/Covering LPs are linear programs with non-negative coefficients.
In this talk, I will present a recent result of Young and Koufogiannakis
(focs 2007)that gives a fast algorithm for approximately solving
packing/covering LPs.
Contact
Khaled Elbassioni
--email hidden
passcode not visible
logged in users only
Khaled Elbassioni, 01/23/2008 18:45 -- Created document.