10 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.DS2021
An Improved Local Search Algorithm for k-Median
Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu +2
We present a new local-search algorithm for the -median clustering problem. We show that local optima for this algorithm give a -approximation; our result improves up…
cs.GT2018★ 10 cited
Fairly Allocating Many Goods with Few Queries
Hoon Oh, Ariel D. Procaccia, Warut Suksompong
We investigate the query complexity of the fair allocation of indivisible goods. For two agents with arbitrary monotonic utilities, we design an algorithm that computes an allocati…