Dear all,
This Thursday we will have another talk at the seminar.
Tung Anh Vu will speak about a paper
by Eisenbrand and Weismantel about
Proximity Results and Faster Algorithms for Integer Programming Using the
Steinitz Lemma
(SODA 2018, ACM Transactions on Algorithms 2019)
It is about a fast algo for IP (although still exponential) that is based
on an innocuous lemma about vectors. Tung insists you don't need any
special prerequisites to understand the talk.
Same place&time as last week:
Time: Thursday 9:50-12:10
Place: S9
For people who cannot come, zoom:
https://cesnet.zoom.us/j/95284272991?pwd=aGxTM29NZVZGUjJWcG8vYWRmYXRSQT09
(I hope I will be able to resolve the sound issues.)
See you there,
R
PS For this email I have used the email conference dedicated to the seminar
-- plus a few additions in the Cc. I hope I did not miss anyone. And also I
ask the people in the Cc to kindly subscribe to the list at
https://kam.mff.cuni.cz/mailman/listinfo/dokt-seminar-l
Thanks.
--
Robert Šámal
IÚUK MFF UK -- CSI of Charles University