Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/143
Title: Scheduling and conflict resolution of television commercials
Authors: Radhakrishnan, Jaikumar
PRASANNA, AVI
Dept. of Mathematics
20061010
Keywords: 2011
Television commercials
Issue Date: May-2011
Abstract: During 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.
URI: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/143
Appears in Collections:MS THESES

Files in This Item:
File Description SizeFormat 
Report_Avi.pdf334.44 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.