New deterministic and randomized algorithms achieve near-linear-time constant-factor approximations for k-center and (k,z)-clustering on graphs, resolving an open problem of Abboud et al.
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
2 Pith papers cite this work, alongside 155 external citations. Polarity classification is still indexing.
2
Pith papers citing it
155
external citations · external index
years
2026 2verdicts
CONDITIONAL 2representative citing papers
Computing GapMAJ∘fⁿ requires n·(I−O(1)) bits of information, making GapMAJ the third outer gadget with a strong composition theorem in two-player communication.
citing papers explorer
-
Faster Randomized and Deterministic k-Clustering on Graphs
New deterministic and randomized algorithms achieve near-linear-time constant-factor approximations for k-center and (k,z)-clustering on graphs, resolving an open problem of Abboud et al.
-
Gap-Majority Lemmas in Communication Complexity
Computing GapMAJ∘fⁿ requires n·(I−O(1)) bits of information, making GapMAJ the third outer gadget with a strong composition theorem in two-player communication.