BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:c094311b-bf56-42df-bc9d-41924decdc13
X-WR-CALNAME:GT AlgoDist\, «Local Constant Approximation for Dominating Set
  on Graphs Excluding Large Minors»\, Timothé Picavet
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20270328T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20241027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20251026T030000
RDATE:20261025T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20250330T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20260329T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:c094311b-bf56-42df-bc9d-41924decdc13
DTSTAMP:20260425T155733Z
CLASS:PUBLIC
DESCRIPTION:Timothé Picavet (LaBRI)\n\nTitle: Local Constant Approximation 
 for Dominating Set on Graphs Excluding Large Minors\n\nAbstract:\n\nWe sho
 w that graphs excluding $K_{2\,t}$ as a minor admit a f(t)-round 50-approx
 imation deterministic distributed algorithm for Minimum Dominating Set. Th
 e result extends to Minimum Vertex Cover. Though fast and approximate dist
 ributed algorithms for such problems were already known for H-minor-free g
 raphs\, all of them have an approximation ratio depending on the size of H
 . To the best of our knowledge\, this is the first example of a large non-
 trivial excluded minor leading to fast and constant-approximation distribu
 ted algorithms\, where the ratio is independent of the size of H. A new ke
 y ingredient in the analysis of these distributed algorithms is the use of
  asymptotic dimension.\n\n           The talk will be in English if there 
 is a non-(sufficiently)-French-speaking person in the audience and in Fren
 ch otherwise.\n\n\n\n\nhttps://algodist.labri.fr/index.php/Main/GT\n\nImpo
 rt automatique depuis https://webmel.u-bordeaux.fr/home/bf-labri.ca@u-bord
 eaux.fr/gt.algo-dist.ics par sync_icals_to_drupal.py pour gt-algodist
DTSTART;TZID=Europe/Paris:20250604T110000
DTEND;TZID=Europe/Paris:20250604T120000
LOCATION:LaBRI salle 178 - lien visio https://webconf.u-bordeaux.fr/b/arn-4
 tr-7gp
SEQUENCE:0
SUMMARY:GT AlgoDist\, «Local Constant Approximation for Dominating Set on G
 raphs Excluding Large Minors»\, Timothé Picavet
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
