Result: Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Title:
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Source:
29th symposium on mathematical foundations of computer science MFCS 2004Discrete applied mathematics. 155(2):119-136
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Recherche information. Graphe, Information retrieval. Graph, Algorithme déterministe, Deterministic algorithms, Borne inférieure, Lower bound, Cota inferior, Calcul automatique, Computing, Cálculo automático, Combinatoire, Combinatorics, Combinatoria, Informatique théorique, Computer theory, Informática teórica, Randomisation, Randomization, Aleatorización, Algorithm en ligne, Analyse compétition, Analyse compétitive, Ensemble borné, Ensemble indépendant maximal, Graphe disque, Disk graph, Graphe intersection, Randomized algorithm, Competitive analysis, Disk graphs, Maximum independent set, On-line algorithms
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece
Max-Planck-Institut für Informatik, Im Stadtwald, Geb. 46.1, 66123 Saarbrücken, Germany
Max-Planck-Institut für Informatik, Im Stadtwald, Geb. 46.1, 66123 Saarbrücken, Germany
ISSN:
0166-218X
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.18454948
Database:
PASCAL Archive
Further Information
We study the on-line version of the maximum independent set problem, for the case of disk graphs which are graphs resulting from intersections of disks on the plane. In particular, we investigate whether randomization can be used to break known lower bounds for deterministic on-line independent set algorithms and present new upper and lower hounds.