Skip to Main content Skip to Navigation
Journal articles

On-line computation and maximum-weighted hereditary subgrah problems

Abstract : 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.
Complete list of metadatas
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:43:14 AM
Last modification on : Monday, February 3, 2020 - 3:40:14 PM


  • HAL Id : hal-01126144, version 1



Marc Demange, Bernard Kouakou, Eric Soutif. On-line computation and maximum-weighted hereditary subgrah problems. Yugoslav Journal of Operations Research, University of Belgrade, 2011, 21, pp.11-28. ⟨hal-01126144⟩



Record views