Improved lower bound for differentially private facility location

Pasin Manurangsi

Abstract: Highlights•Study facility location problem under differential privacy constraints in the super-set output model.•Previous best algorithm gave O(log⁡n/ϵ)-approximation and previous lower bound on the approximation ratio was O(1/ϵ).•We give Ω˜(min⁡{log⁡n,log⁡n/ϵ}) on the approximation ratio; this is the first known lower bound that grows with n.