Digital Repository

Scheduling and conflict resolution of television commercials

Show simple item record

dc.contributor.advisor Radhakrishnan, Jaikumar en_US
dc.contributor.author PRASANNA, AVI en_US
dc.date.accessioned 2011-05-11T11:50:53Z
dc.date.available 2011-05-11T11:50:53Z
dc.date.issued 2011-05 en_US
dc.identifier.uri http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/143
dc.description.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. en_US
dc.description.sponsorship IISER Pune en_US
dc.language.iso en en_US
dc.subject 2011
dc.subject Television commercials en_US
dc.title Scheduling and conflict resolution of television commercials en_US
dc.type Thesis en_US
dc.type.degree BS-MS en_US
dc.contributor.department Dept. of Mathematics en_US
dc.contributor.registration 20061010 en_US


Files in this item

This item appears in the following Collection(s)

  • MS THESES [1703]
    Thesis submitted to IISER Pune in partial fulfilment of the requirements for the BS-MS Dual Degree Programme/MSc. Programme/MS-Exit Programme

Show simple item record

Search Repository


Advanced Search

Browse

My Account