An algorithm for selecting programme slots to broadcast advertisements in parallel in different television channels

Author

Bandyopadhyay, Sumana ; Pal, Rajat Kumar

Author_Institution

Dept. of Comput. Sci., Prabhu Jagatbandhu Coll., Howrah, India

Volume

2

fYear

2011

fDate

10-12 June 2011

Firstpage

399

Lastpage

403

Abstract

The most popular electronic media television snatches out at least a few minutes from all of our daily life. Therefore, it is natural that various production units will try to figure out the most popular programmes during which they can launch advertisements of their products. In this paper, the problem is depicted from the graphical point of view and comparability graph is used to model the problem. As the paper aims to find out k parallel disjoint sessions (nonintersecting programme slots) that reach to a largest number of viewers, the problem turns into computing a maximum weighted k clique in the comparability graph (the graph is weighted by the television rating of each programme).

Keywords

advertising; graph theory; telecommunication channels; television broadcasting; broadcast advertisements; comparability graph; electronic media television; k-parallel disjoint sessions; television channels; weighted k-clique; Advertising; Computational modeling; Copper; Data structures; Media; Real time systems; TV; Advertisement; Algorithm; Clique computation problem; Comparability graph; Electronic media; Perfect graph; TRP rating; Weighted clique;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-8727-1

Type

conf

DOI

10.1109/CSAE.2011.5952496

Filename

5952496