BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20180325T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260404T110126Z
UID:59c8cedc49a1f012658605@ist.ac.at
DTSTART:20180911T160000
DTEND:20180911T180000
DESCRIPTION:Speaker: Dominik Schröder\nhosted by Laszlo Erdös\nAbstract: 
 In this talk we define the concept of lifted multicuts and study polyhedra
 l techniques for their combinatorial optimisation. While the problem is NP
 -hard for most graphs (including trees)\, we present results on the facet-
 defining inequalities for the case of paths. Potential applications includ
 e time series segmentation\, e.g. word separation in speech recordings.
LOCATION:Big Seminar room Ground floor / Office Bldg West (I21.EG.101)\, IS
 TA
ORGANIZER:jdeanton@ist.ac.at
SUMMARY:Dominik Schröder: Lifted multicuts on paths: combinatorial optimiz
 ation and polyhedral geometry
URL:https://talks-calendar.ista.ac.at/events/1394
END:VEVENT
END:VCALENDAR