Abstract (EN)

In on-line computation, the instance of a problem is revealed step-by-step and one has, at the end of each step, to irrevocably decide on the part of the final solution dealing with this step. In this paper, we study the on-line independent set under a model assuming that the input graph G is revealed by non-empty clusters, i.e., by induced subgraphs of G. We suppose that the order of the graph, as well as the number of clusters needed so that the whole of the graph is revealed are a priori known. The algorithm we propose implies approximation of the vertex-coloring problem in each cluster. We first establish a general result for the competitivity of the method studied. Next, we restrict ourselves in natural and well-known independent set sub-problems and perform a precise evaluation of the competitivity ratio of our algorithm for the sub-problems considered.