Title of article
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs Original Research Article
Author/Authors
Ioannis Caragiannis، نويسنده , , Aleksei V. Fishkin، نويسنده , , Christos Kaklamanis، نويسنده , , Evi Papaioannou، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
18
From page
119
To page
136
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.
Keywords
On-line algorithms , Competitive analysis , Maximum independent set , Disk graphs
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886404
Link To Document