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.
url: http://www.cs.toronto.edu/ bor/2420s19/papers/draft-ch1-8.pdf, DRAFT: March 14, 2019
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.