Online maximum k-coverage - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

Online maximum k-coverage

Résumé

We study an online model for the maximum k-vertex-coverage problem, where given a graph G = (V,E) and an integer k, we ask for a subset $A\subseteqV$ , such that |A| = k and the number of edges covered by A is maximized. In our model, at each step i, a new vertex vi is revealed, and we have to decide whether we will keep it or discard it. At any time of the process, only k vertices can be kept in memory; if at some point the current solution already contains k vertices, any inclusion of any new vertex in the solution must entail the irremediable deletion of one vertex of the current solution (a vertex not kept when revealed is irremediably deleted). We propose algorithms for several natural classes of graphs (mainly regular and bipartite), improving on an easy 1/2-competitive ratio. We next settle a set-version of the problem, called maximum k-(set)-coverage problem. For this problem we present an algorithm that improves upon former results for the same model for small and moderate values of k.
Fichier principal
Vignette du fichier
cahier_299.pdf (229.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00876975 , version 1 (25-10-2013)

Identifiants

  • HAL Id : hal-00876975 , version 1

Citer

Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Paschos. Online maximum k-coverage. 2010. ⟨hal-00876975⟩
128 Consultations
338 Téléchargements

Partager

Gmail Facebook X LinkedIn More