Volume 40, Number 2, April-June 2006ROADEF 03
|Page(s)||129 - 142|
|Published online||12 October 2006|
On-line models and algorithms for max independent set
Université Paris-Dauphine, 75775 Paris Cedex 16, France;
In on-line computation, the instance of the problem dealt is not entirely known from the beginning of the solution process, but it is revealed step-by-step. In this paper we deal with on-line independent set. On-line models studied until now for this problem suppose that the input graph is initially empty and revealed either vertex-by-vertex, or cluster-by-cluster. Here we present a new on-line model quite different to the ones already studied. It assumes that a superset of the final graph is initially present (in our case the complete graph on the order n of the final graph) and edges are progressively removed until the achievement of the final graph. Next, we revisit the model introduced in [Demange, Paradon and Paschos, Lect. Notes Comput. Sci. 1963 (2000) 326–334] and study relaxations assuming that some paying backtracking is allowed.
Mathematics Subject Classification: 05C69 / 68Q25 / 68W25
Key words: Approximation algorithms / competitive ratio / maximum independent set / on-line algorithms.
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.