Scheduling and conflict resolution of television commercials

dc.contributor.advisorRadhakrishnan, Jaikumaren_US
dc.contributor.authorPRASANNA, AVIen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.contributor.registration20061010en_US
dc.date.accessioned2011-05-11T11:50:53Z
dc.date.available2011-05-11T11:50:53Z
dc.date.issued2011-05en_US
dc.description.abstractDuring this project, I studied the basics of Algorithms and ideas in a much more concrete way. By attending a course on "Selected Topics in Algorithm", I got a chance to study the subject in depth, which helped me to get the insight into the subject. I learnt basic algorithms like max-cut problems, balanced max - cut, max k-cut, 2-SAT, 3-SAT etc. Then I studied stu®s related to Steiner trees. Finally in the end I studied an algorithm written by Gaur et al. for the Scheduling and Con°ict Resolution of Television commercials. We tried to solve this problem in a di®erent and simple way by following and using a di®erent algorithm that gives us the same performance ratio, in other words we solved this problem by using a simple algorithm which gave us the same optimal result as in the work done by Gaur et al.en_US
dc.description.sponsorshipIISER Puneen_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/143
dc.language.isoenen_US
dc.subject2011en_US
dc.subjectTelevision commercialsen_US
dc.titleScheduling and conflict resolution of television commercialsen_US
dc.typeThesisen_US
dc.type.degreeBS-MSen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Report_Avi.pdf
Size:
334.44 KB
Format:
Adobe Portable Document Format

Collections