Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
Mark Keil and Anil Maheshwari and Saeed Mehrabi and Debajyoti Mondal and Michiel H
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Witness Set for simple polygons is in NP ∩ XP and admits an n^{f(k)}-time algorithm via combinatorial discretization, in contrast to its ∃R-complete dual.
Polynomial samples learn dual pricing and polynomial queries learn near-optimal anonymous pricing for online resource allocation with heterogeneous agents.
citing papers explorer
-
The price of incrementality in k-center clustering
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
-
Witness Set: A Visibility Problem in $NP\cap XP$
Witness Set for simple polygons is in NP ∩ XP and admits an n^{f(k)}-time algorithm via combinatorial discretization, in contrast to its ∃R-complete dual.
-
Learning Anonymous Pricing for Online Resource Allocation
Polynomial samples learn dual pricing and polynomial queries learn near-optimal anonymous pricing for online resource allocation with heterogeneous agents.