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

Authors:
Ioannis Caragiannis;Aleksei V. Fishkin;Christos Kaklamanis;Evi Papaioannou
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;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 11
Cited 3

Unit disk graphs

Discrete Mathematics - Topics on domination
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Online computation and competitive analysis

Online computation and competitive analysis
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Online interval scheduling

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Representing graphs by disks and balls (a survey of recognition-complexity results)

Discrete Mathematics
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Polynomial-time approximation schemes for packing and piercing fat objects

Journal of Algorithms
A robust PTAS for maximum weight independent sets in unit disk graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Scheduling to maximize participation

Theoretical Computer Science
On the Advice Complexity of Online Problems

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Scheduling to maximize participation

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing

Quantified Score

Hi-index	0.05

Visualization

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.