BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Given an optimal solution to a linear program\, how far away c
 an a nearest optimal integral solution be? In 1986 Cook\, Gerards\, Schrijv
 er\, and Tardos gave a bound for this distance\, known as proximity\, which
  depends only on the dimension and the largest possible magnitude of any su
 bdeterminant of the corresponding constraint matrix. In this talk I will br
 iefly survey this problem\, describe some long standing related conjectures
 \, and highlight some recent developments including a recent improvement to
  the Cook et al. bound when the dimension is at least 2. This is joint work
  with Joseph Paat\, Stefan Kuhlmann\, and Robert Weismantel. 
DTSTAMP:20220630T190700
DTSTART:20220704T160000
CLASS:PUBLIC
LOCATION:Technische Universität Berlin\n Institut für Mathematik\n Straße d
 es 17. Juni 136\n 10623 Berlin\n Room MA 041 (Ground Floor)
SEQUENCE:0
SUMMARY:Marcel Celaya (ETH\, Zürich): Improving the Cook et al. Proximity B
 ound Given Integral Valued Constraints
UID:107920528@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20220704-C-Cel
 aya.html
END:VEVENT
END:VCALENDAR