BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:506a27d7-b43e-4a74-9d11-1c3b013a7898
X-WR-CALNAME:[gt.go] - 'Approximation Schemes for finding multicolored non-
 crossing structures in the plane and in planar graphs' by François Dross
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20241027T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:506a27d7-b43e-4a74-9d11-1c3b013a7898
DTSTAMP:20260531T233644Z
CLASS:PUBLIC
DESCRIPTION:/Exposé en anglais/Talk in english/ \n\nIn this presentation\, 
 we will talk about connecting colored points via noncrossing structures. S
 everal problems fall into this category. G iven a set of colored terminal 
 points\, we want to find a graph for each color that connects all terminal
 s of its color with the restrictio n that no two graphs cross each other. 
 We will look for such graphs with certain specific structure. If the graph
  is not restrained (or re strained to be a tree)\, the problem is Multicol
 ored Non-crossing Steiner Tree. If the graph is a cycle\, the problem is M
 ulticolored Non-cr ossing Travelling Salesman Problem... We will consider 
 these problems both on the Euclidean plane and in planar graphs. Another l
 inked pro blem that we will talk about is the problem of separating colore
 d points in the plane accoring to their colors\, using non-crossing cycles
 . \n\nThe aim of this talk will be to present a method to approximate thes
 e problems efficiently\, when there is a small number of colors (two o r t
 hree\, depending on the problem). The trick relies on a way to bound the n
 umber of times a given area in the plane\, that we will call po rtal\, nee
 ds to be crossed when there are two colors. The rest of the proof heavily 
 relies on Arora's scheme\, that we will also present. We may also have tim
 e to talk about the negative side\, and\, more precisely\, complexity resu
 lts. \n\n[François Dross] (LaBRI ) \n\nhttps://sites.google.com/view/franc
 oisdross/home \n\n\nRemarks / Remarques \n\nFind all the information of th
 e working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.ph
 p/Groupe/GT?userlang=en | web page ] . \nRetrouvez toutes les informations
  du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Group
 e/GT | page web ] .
DTSTART;TZID=Europe/Paris:20230203T140000
DTEND;TZID=Europe/Paris:20230203T150000
LOCATION:https://webconf.u-bordeaux.fr/b/mar-ef4-zed and LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'Approximation Schemes for finding multicolored non-cross
 ing structures in the plane and in planar graphs' by François Dross
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
