On-line models for set-covering: the power of greediness - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2006

On-line models for set-covering: the power of greediness

Résumé

We study an on-line model for set-covering implying that elements of the ground set of size n arrive one-by-one and with any such element i, arrive also the names of the sets containing it in the nal instance. Any new element has to be processed irrevocably before the arrival of the next element. We study limits on the competitiveness of several greedy rules solving several alternatives of this basic model. For any of them we give lower and upper bounds for the competitive ratio achieved. We nally deal with the maximum budget saving problem. Here, an initial budget is allotted that is destined to cover the cost of an algorithm for solving set-covering and the objective is to maximize the savings on the initial budget.
Fichier principal
Vignette du fichier
cahier_235.pdf (311.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00957563 , version 1 (10-03-2014)

Identifiants

  • HAL Id : hal-00957563 , version 1

Citer

Giorgio Ausiello, Aristotelis Giannakos, Vangelis Paschos. On-line models for set-covering: the power of greediness. 2006. ⟨hal-00957563⟩
91 Consultations
31 Téléchargements

Partager

Gmail Facebook X LinkedIn More