BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:75a7c551-6f86-4c5d-a528-4408f29e50c8
X-WR-CALNAME:[gt.go] - 'Online Demand Strip Packing' by Sebastian Bruchhold
  (TU Berlin)
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20280326T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20251026T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20261025T030000
RDATE:20271031T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20260329T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20270328T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:75a7c551-6f86-4c5d-a528-4408f29e50c8
DTSTAMP:20260528T042619Z
CLASS:PUBLIC
DESCRIPTION:In the Demand Strip Packing problem (DSP)\, we are given a fini
 te set of axis-aligned rectangular items\, each characterized by a specifi
 c width and height. These items need to be packed without rotation into a 
 strip of fixed width while minimizing the peak demand: the maximum sum of 
 heights of items placed at any point on the x-axis. We are the first to co
 nsider the online variant of the problem\, where items are revealed to an 
 algorithm one by one in a list. Upon arrival\, each item must be placed on
  the strip irrevocably before the next item in the list is revealed. As us
 ual in online optimization\, we evaluate the performance of online algorit
 hms using competitive analysis. We give a strictly 4.263-competitive algor
 ithm\, significantly improving upon the respective bound of 6.479 for Onli
 ne Strip Packing. Additionally\, we prove a lower bound of 1.812 on the ab
 solute competitive ratio of any online algorithm for DSP and\, thus\, clea
 rly separate Online DSP from Online Minimum Peak Appointment Scheduling (M
 PAS)\, a special case of Online DSP\, for which a strictly 5/3-competitive
  algorithm is known. \n\nThis is joint work with Franziska Eberle\, Georgi
 os Moneftsis\, Malin Rau\, and Albert Vesterlund. \n\n\n\nSebastian Bruchh
 old (TU Berlin) \n\nVérifiez que vous êtes bien inscrits sur le site du [g
 dr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipe
 s/Equipes#membres | https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/E
 quipes#membres ] \n\nRemarks / Remarques \n\nFind all the information of t
 he working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.p
 hp/Groupe/GT?userlang=en | web page ] . \nRetrouvez toutes les information
 s du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Grou
 pe/GT | page web ] . \n\n\n\nImport automatique depuis https://webmel.u-bo
 rdeaux.fr/home/bf-labri.ca@u-bordeaux.fr/gt.go.ics par sync_icals_to_drupa
 l.py pour GT-GO
DTSTART;TZID=Europe/Paris:20260529T140000
DTEND;TZID=Europe/Paris:20260529T150000
LOCATION:LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'Online Demand Strip Packing' by Sebastian Bruchhold (TU 
 Berlin)
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
