A deterministic semi-streaming algorithm achieves an O(Δ)-coloring in O(√log Δ) passes, the first with linear palette size and sublogarithmic passes.
Random Structures & Algorithms , volume =
2 Pith papers cite this work, alongside 569 external citations. Polarity classification is still indexing.
2
Pith papers citing it
569
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Greedy vector balancing on finite unit-vector sets T in R^d achieves norm bound (2/δ_T)^{d-1} independent of sequence length n.
citing papers explorer
-
Faster Deterministic Streaming Vertex Coloring
A deterministic semi-streaming algorithm achieves an O(Δ)-coloring in O(√log Δ) passes, the first with linear palette size and sublogarithmic passes.