Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs

Ioannis Caragiannis,Aleksei V Fishkin,Christos Kaklamanis,Evi Papaioannou

doi:10.1016/j.dam.2006.04.036

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs

Ioannis Caragiannis, Aleksei V Fishkin + Show 2 more

Open Access

https://doi.org/10.1016/j.dam.2006.04.036

Copy DOI

Journal: Discrete Applied Mathematics	Publication Date: Jun 27, 2006
Citations: 28	License type: publisher-specific-oa

Affiliation: Research Academic Computer Technology Institute, Max Planck Institute for Informatics

#Sets In Disk Graphs #Intersections Of Disks + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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 bounds.

Full Text