BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/222
DTSTAMP:20230914T125915Z
SUMMARY:Approximate Colouring using Semi Definite Programming
DESCRIPTION:Speaker: Girish Varma\n\nAbstract: \nDetermining the chromatic 
 number of a graph is known to be NP-hard. We will consider the problem of 
 coloring a $k$-colorable graph on n vertices with $n^{\\alpha}$ colors (wh
 ere $\\alpha < 1$). We will give an algorithm for this problem using Semi 
 Definite Programming (a generalization of LP ).\n
URL:https://www.tcs.tifr.res.in/web/events/222
DTSTART;TZID=Asia/Kolkata:20111114T160000
DTEND;TZID=Asia/Kolkata:20111114T170000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR