BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/318
DTSTAMP:20230914T125919Z
SUMMARY:A Lower Bound for Additive Spanners
DESCRIPTION:Speaker: Nithin M. Varma\n\nAbstract: \nGiven an undirected unw
eighted graph $G$\, a \\beta-additive spanner of $G$ is a subgraph H of G
in which the shortest distance between any pair of vertices is stretched w
ithin an additive factor \\beta of their shortest distance in $G$. The str
etch of a subgraph $H$ of $G$ is defined as the stretch of the worst stret
ched pair in $H$. It is clear that\, the stretch increases as the subgraph
gets sparser. In this talk\, we'll discuss a lower bound on the number of
edges in a spanner having a fixed stretch.\n
URL:https://www.tcs.tifr.res.in/web/events/318
DTSTART;TZID=Asia/Kolkata:20121109T150000
DTEND;TZID=Asia/Kolkata:20121109T163000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR