BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:ad03e981-0a2b-404a-8ee7-8aa7a643d93a
X-WR-CALNAME:[gt.go] - 'Steiner Tree Packing Problem' by Yaping Mao
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20250330T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:ad03e981-0a2b-404a-8ee7-8aa7a643d93a
DTSTAMP:20260916T043310Z
CLASS:PUBLIC
DESCRIPTION:/Exposé en anglais/Talk in english/ \n\nSteiner tree is popular
 ly used in the physical design of VLSI circuits and network science. Stein
 er tree is also used in computer communication networks and optical wirele
 ss communication networks. For a given graph G and a vertex subset S\, the
  problem that asks to find a set of maximum number of edge-disjoint Steine
 r trees connecting S of G is called the Steiner tree packing problem\, whi
 ch studies local properties of graphs or networks. Generalized (edge-)conn
 ectivity is an Steiner tree packing parameter\, which focuses on global pr
 operties of graphs or networks. \n\nIn this talk\, we present the computat
 ional complexity and some known results of generalized connectivity. We al
 so introduce recent progress of Kriesell Conjecture on Steiner tree packin
 g problem and West-Wu Conjecture on S-connectors. \n\n\n[Yaping Mao] (Qing
 hai Normal University ) \n\nhttps://math.qhnu.edu.cn/info/1157/1593.htm \n
 \nRemarks / Remarques \n\nFind all the information of the working group on
  this [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT?userla
 ng=en | web page ] . \nRetrouvez toutes les informations du GT sur cette [
  https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT | page web ] 
 .
DTSTART;TZID=Europe/Paris:20230526T140000
DTEND;TZID=Europe/Paris:20230526T150000
LOCATION:LaBRI/178 and https://webconf.math.cnrs.fr/b/mar-zjd-6dz
SEQUENCE:0
SUMMARY:[gt.go] - 'Steiner Tree Packing Problem' by Yaping Mao
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR