BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/18
DTSTAMP:20230914T125906Z
SUMMARY:Network Design with Metric Costs
DESCRIPTION:Speaker: Joseph Cheriyan\nUniversity of Waterloo\nCanada\nhttp:
//www.math.uwaterloo.ca/~jcheriya/\n\nAbstract: \nA typical problem in net
work design is to find a subgraph H of a given graph G such that H satisfi
es some connectivity requirements and has minimum cost. We give a constant
-factor approximation algorithm for network design with node-connectivity
requirements of zero or k\, assuming that the edge costs satisfy the trian
gle inequalities (joint work with A.Vetta\, McGill University).\n
URL:https://www.tcs.tifr.res.in/web/events/18
DTSTART;VALUE=DATE:20090729
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR