Campus Event Calendar
Event Entry
What and Who
Rounding. An introduction to the algorithmic geometry of numbers I/II
Friedrich Eisenbrand
Max-Planck-Institut für Informatik - AG 1
Lecture
AG 1, AG 2, AG 3, AG 4
MPI Audience
German
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 5 December 2002
11:15
90 Minutes
46.1 - MPII
007
Saarbrücken
Abstract
In this lecture I will (in a slow pace) present the powerful result of Tardos and Frank which implies that a 0/1 optimization problem can be
solved in polynomial time if and only if it can be solved in strongly
polynomial time.
For this we have to learn about lattices and basis reduction.
The lectures last approx. 1.30h. After the lecture, we have pizza and
discuss assigned exercises.
Contact
Friedrich Eisenbrand
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Pizza only for people who try hard to solve the assignment!!!!