A method to select programme slots for giving advertisements in different television channels

摘要

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. Vertices denote the programmes on different channels and edges are introduced to denote time dependencies among the programmes broadcasted on different channels. In this paper, the graph obtained in this way is a kind of perfect graph, specifically, it is known as comparability graph. As the paper aims to find out nonintersecting programme slots that reach to a largest number of viewers, the problem turns into computing a maximum weighted clique in the comparability graph (the graph is weighted by the number of viewers of each programme).