Campus Event Calendar
Event Entry
What and Who
Improving results from two STOC papers
Rene Beier
Max-Planck-Institut für Informatik - AG 1
Talk
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 25 January 2006
13:30
30 Minutes
46.1 - MPII
Rotunda AG1
Saarbrücken
Abstract
I'd like to discuss (get you interested into) a problem that unifies and improves the theory from two seemingly unrelated STOC papers (so other people beside me think this is interesting). The theory can be used for various things like proving polynomial smoothed complexity for Integer linear programming, bounding the number of Pareto optimal solutions for multicriteria optimization problems, or having a great time while thinking about a solution for the problem. The problem itself is easy to state (but not easy enough for this abstract:), no special knowledge is required.
This will be an informal talk (so casual clothing is OK :)
Contact
René Beier
--email hidden
passcode not visible
logged in users only
René Beier, 01/23/2006 16:42 -- Created document.