• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

On-line independent set by coloring vertices

Thumbnail
Date
2001
Dewey
Recherche opérationnelle
Sujet
Independent set; Coloring; Approximation algorithm; On-line computation
Journal issue
Operational Research
Volume
1
Number
3
Publication date
09-2001
Article pages
213-224
Publisher
Springer
DOI
http://dx.doi.org/10.1007/BF02936352
URI
https://basepub.dauphine.fr/handle/123456789/3835
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Paschos, Vangelis
Type
Article accepté pour publication ou publié
Abstract (EN)
In on-line computation, the instance of a problem is revealed step-by-step and one has, at the end of each step, to irrevocably decide on the part of the final solution dealing with this step. In this paper, we study the on-line independent set under a model assuming that the input graph G is revealed by non-empty clusters, i.e., by induced subgraphs of G. We suppose that the order of the graph, as well as the number of clusters needed so that the whole of the graph is revealed are a priori known. The algorithm we propose implies approximation of the vertex-coloring problem in each cluster. We first establish a general result for the competitivity of the method studied. Next, we restrict ourselves in natural and well-known independent set sub-problems and perform a precise evaluation of the competitivity ratio of our algorithm for the sub-problems considered.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.