A greedy online algorithm achieves optimal competitive ratio ζ for independent set on bounded-kissing-number graphs, while randomized geometric algorithms yield polylog-competitive ratios for unit balls in R^3 and α-fat objects.
The problem of the twenty-five spheres.Russian Mathematical Surveys, 58(4):794
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Algorithms for Geometric Independent Set
A greedy online algorithm achieves optimal competitive ratio ζ for independent set on bounded-kissing-number graphs, while randomized geometric algorithms yield polylog-competitive ratios for unit balls in R^3 and α-fat objects.