BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: I will present some of my joint work with Jean Cardinal on the
  complexity of computing and approximating shortest paths in the skeleton o
 f a combinatorially defined polytope. In particular\, I will discuss proofs
  for the inapproximability of finding shortest paths on the skeleton of per
 fect matching polytopes\, and of polymatroids\, and discuss various related
  context and problems in which our work is embedded. 
DTSTAMP:20231212T154600
DTSTART:20240108T141500
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Seminar room 053 (ground floor)
SEQUENCE:0
SUMMARY:Raphael Steiner (ETH Zürich): Shortest paths on combinatorial polyt
 opes: Hardness and approximation
UID:138261525@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20240108-L-Ste
 iner.html
END:VEVENT
END:VCALENDAR