A novel nuanced analysis of local search that allows us to isolate a subset of clients on which the authors lose essentially nothing compared to the optimal solution, while losing an approximation factor of $3$ on the rest of the clients.
Rares-Darius Buhai, Vincent Cohen-Addad, Henry L. Fleischmann et al.· 0 citations
The Greedy algorithm of Jain, Mahdian, Markakis, Saberi, and Vazirani was the best Lagrangian-multiplier-preserving (LMP) approximation algorithm for facility location, and thus the engine behind the best $k$-median guarantees, for over two decades. Its $2$-LMP guarantee was only recently broken by a small amount ($(2-...
Rares-Darius Buhai, Vincent Cohen-Addad, Henry L. Fleischmann et al.· 0 citations
A new dual fitting algorithm is given which tightly accounts for dual payments while still facilitating an effective dual feasibility analysis, and a new framework that uses spectral analysis for determining the approximation factor of the algorithm is introduced.
Aditya Anand, Moses Charikar, Vincent Cohen-Addad et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.