Online Algorithms for Disk Graphs

We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, 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; we also present an improved upper bound for on-line coloring.

• Type: Conference
• Year: 2004
• Where: MFCS
• Authors: Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
• Keywords: Independent Set, Lower Bounds, Maximum Independent Set, MFCS 2004