Campus Event Calendar
Event Entry
What and Who
Clarksons algorithm for IP in fixed dimension
Friedrich Eisenbrand
Max-Planck-Institut für Informatik - AG 1
Talk
AG 1, AG 2, AG 3, AG 4
Expert Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 9 January 2003
13:30
-- Not specified --
46.1 - MPII
024
Saarbrücken
Abstract
I will review the algorithm of Clakson for (I)LP in fixed dimension.
The remarkable fact is: The number of base cases is logarithmic in
the number of constraints.
This yields an O(m + log m s^2) algorithm for ILP in fixed dimension,
where each of the m constraints has binary encoding length at most s.
Contact
Friedrich Eisenbrand
--email hidden
passcode not visible
logged in users only