Happy to share that our better-than-2 approximation results for k-median are now on arXiv:
https://t.co/NvjU9FQfHh
https://t.co/6lPuN5Voyc
It has been a pleasure working with this fantastic group: @rares_buhai , Vincent Cohen-Addad, Henry Fleischmann, @anupamg , Antoni "Toni" Jubés Monforte, Madhusudhan Reddy Pittu, @mstou73, and @LukasBirdyy
A special shout-out to Toni, who started working on this problem for his Master's thesis almost two years ago. His work led to the impressive analysis of the factor-revealing LP!
Now on to other things...
We'll put up our work on a better-than-2 approximation on the arXiv soon; this is work over the last year with excellent people at NYU/CMU, Vincent Cohen-Addad, and with Ola @AlgoSvensson and his great crew at EPFL.
OpenAI completely solved a problem on which my students have worked hard for 1+ years and made significant progress. They should be proud to have pushed on a problem appearing in this historic list of ~400 results.
We’ll soon upload our different algorithmic approach to k-median.