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
Dear everybody,
on my mentor's recommendation, I will speak about another paper
On Integer Programming and Convolution by Klaus Jansen, and Lars Rohwedder //(ITCS 2019)
which further improves on the results of the originally assigned paper. I still insist that there are no special prerequisites required to understand the talk 😉
Attached you will find a handout for the talk.
Best Tung
On 10/19/21 23:43, Robert Samal wrote:
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
Doctoral seminar announcement mailing list [dokt-seminar-l] To unsubscribe and edit your options, visit: https://kam.mff.cuni.cz/mailman/listinfo/dokt-seminar-l
Hi all, today I mentioned an open problem of improving the n^O(n) algorithm by Dadush. His dissertation is here: https://homepages.cwi.nl/~dadush/papers/dadush-thesis.pdf On page 243 he mentions that if Conjecture 7.4.5 holds, his algorithm runs in O(log n)^n.
Conjecture 7.4.5 is called "Subspace Flatness Conjecture" and you should have a look at it yourself, and I attributed it incorrectly only to Lovász when it belongs to Lovász and Kannan and Dadush references the paper "Covering minima and lattice point free convex bodies,”AnnalsofMathematics, vol. 128, pp. 577–602, 1988.
Best wishes to everyone, Martin
On St, říj 20 2021 at 10:03:23 +0200, Tung Anh Vu tung@kam.mff.cuni.cz wrote:
Dear everybody,
on my mentor's recommendation, I will speak about another paper
On Integer Programming and Convolution by Klaus Jansen, and Lars Rohwedder/ /(ITCS 2019)
which further improves on the results of the originally assigned paper. I still insist that there are no special prerequisites required to understand the talk 😉
Attached you will find a handout for the talk.
Best Tung
On 10/19/21 23:43, Robert Samal wrote:
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
Doctoral seminar announcement mailing list [dokt-seminar-l] To unsubscribe and edit your options, visit: https://kam.mff.cuni.cz/mailman/listinfo/dokt-seminar-l
Dear all,
If you wish to leave a feedback for Tung's presentation today (please do!), you may do it at https://forms.office.com/r/XGsGCM30km
If you haven't already filled in the response for last week's presentation by Pankaj, this is the last chance, tomorrow morning I will close the form.
Best,
R
-- Robert Šámal IÚUK MFF UK -- CSI of Charles University
On Wed, 20 Oct 2021 at 10:03, Tung Anh Vu tung@kam.mff.cuni.cz wrote:
Dear everybody,
on my mentor's recommendation, I will speak about another paper
On Integer Programming and Convolution by Klaus Jansen, and Lars Rohwedder (ITCS 2019)which further improves on the results of the originally assigned paper. I still insist that there are no special prerequisites required to understand the talk 😉
Attached you will find a handout for the talk.
Best Tung
On 10/19/21 23:43, Robert Samal wrote:
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
Doctoral seminar announcement mailing list [dokt-seminar-l] To unsubscribe and edit your options, visit:https://kam.mff.cuni.cz/mailman/listinfo/dokt-seminar-l
dokt-seminar-l@kam.mff.cuni.cz