BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:9590dfd3-2251-4638-b8af-584d187228c5
X-WR-CALNAME:GT AlgoDist\, «Greediness is not always a vice: Efficient Disc
 overy Algorithms for Assignment Problems»\, Ralf Klasing
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20261025T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20241027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
RDATE:20260329T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:9590dfd3-2251-4638-b8af-584d187228c5
DTSTAMP:20260409T234424Z
CLASS:PUBLIC
DESCRIPTION:Ralf Klasing (LaBRI)\n\nTitle: Greediness is not always a vice:
  Efficient Discovery Algorithms for Assignment Problems\n\nAbstract:\n\nFi
 nding a maximum-weight matching is a classical and well-studied problem in
  computer science\, solvable in cubic time in general graphs. We introduce
  and consider in this work the ‘‘discovery’’ variant of the bipartite matc
 hing problem (or assignment problem) where edge weights are not provided a
 s input but must be queried\, requiring additional and costly computations
 . Hence\, discovery algorithms are developed aiming to minimize the number
  of queried weights while providing guarantees on the computed solution. W
 e show in this work the hardness of the underlying problem in general whil
 e providing several efficient algorithms that can make use of natural assu
 mptions about the order in which the nodes are processed by the greedy alg
 orithms. Our motivations for exploring this problem stem from finding prac
 tical solutions to maximum-weight matching in hypergraphs\, a problem rece
 ntly emerging in the formation of peer-to-peer energy sharing communities.
 \n\n\nhttps://algodist.labri.fr/index.php/Main/GT\n\nImport automatique de
 puis https://webmel.u-bordeaux.fr/home/bf-labri.ca@u-bordeaux.fr/gt.algo-d
 ist.ics par sync_icals_to_drupal.py pour gt-algodist
DTSTART;TZID=Europe/Paris:20250129T110000
DTEND;TZID=Europe/Paris:20250129T120000
LOCATION:LaBRI salle 178 - lien visio https://webconf.u-bordeaux.fr/b/arn-4
 tr-7gp
SEQUENCE:0
SUMMARY:GT AlgoDist\, «Greediness is not always a vice: Efficient Discovery
  Algorithms for Assignment Problems»\, Ralf Klasing
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
