BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: I will discuss three unrelated sets of results combining geome
 try and algorithms. First we will see classes of graphs defined using the i
 ntersection of geometric objects in the plane\, and discuss classical optim
 ization problems for them. Then we will consider approximation algorithms f
 or the potato peeling problem: find a maximum-area convex body inside a giv
 en polygon. The problem amounts to finding a maximum clique in the visibili
 ty graph of random samples of points inside the polygon\, and results from 
 stochastic geometry are used to bound the size of the samples. Finally\, we
  will discuss the efficient computation of Shapley values for coalitional g
 ames defined by the area of usual geometric objects\, such as the convex hu
 ll or the minimum axis-parallel bounding box. 
DTSTAMP:20190121T130900
DTSTART:20190211T141500
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Sergio Cabello (Universität Ljubljana): Computational geometry\, op
 timization and Shapley values
UID:95623697@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20190211-L-Cab
 ello.html
END:VEVENT
END:VCALENDAR