An algorithm for selecting programme slots to broadcast advertisements in parallel 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 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).