BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/25
DTSTAMP:20230914T125907Z
SUMMARY:Approximate Shortest Descent Path on a Terrain
DESCRIPTION:Speaker: Sasanka Roy\nIndian Institute of Science\nBangalore 56
 0012\nhttp://www.csa.iisc.ernet.in/people/people-postdoc.php\n\nAbstract: 
 \nA path from $s$ to $t$ on a polyhedral terrain is descending if the heig
 ht of a point $p$ never increases while we move p along the path from $s$ 
 to $t$. No efficient algorithm is known to find a shortest descending path
  (SDP) from $s$ to $t$ in a polyhedral terrain. We will discuss the pros a
 nd cons for finding the optimum path on general terrains and finally discu
 ss an approximation algorithm that solve the SDP problem on general terrai
 ns. Our algorithm is simple\, robust and easy to implement.\n
URL:https://www.tcs.tifr.res.in/web/events/25
DTSTART;VALUE=DATE:20090825
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR