On-line computation and maximum-weighted hereditary subgraph problems

• Main Authors: Demange Marc, Kouakou Bernard, Soutif Eric
• Format: Article
• Language: English
• Published: University of Belgrade 2011-01-01
• Series: Yugoslav Journal of Operations Research
• Subjects: On-line algorithms; hereditary property; independent set; competitive ratio
• Online Access: http://www.doiserbia.nb.rs/img/doi/0354-0243/2011/0354-02431101011D.pdf

In this paper1 we study the on-line version of maximum-weighted hereditary subgraph problems. In our on-line model, the final instance (a graph with n vertices) is revealed in t clusters, 2 ≤ t ≤ n . We first focus on an on-line version of the maximumweighted hereditary subgraph problem. Then, we deal with the particular case of the independent set problem. We are interested in two types of results: the competitive ratio guaranteed by the on-line algorithm and hardness results that account for the difficulty of the problems and for the quality of algorithms developed to solve them.