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
This work presents a nontrivial modification of the Greedy algorithm that operates with only [Formula: see text] adaptive phases and develops a novel [Formula: see text]-approximation algorithm tailored for stable instances, where removing any center from an optimal solution increases the cost by at least an [Formula:...
Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee et al.· SIAM journal on computing (P...· 0 citations
This work introduces TCS-Bench, a benchmark for evaluating Large Language Models (LLMs) on research-level Theoretical Computer Science (TCS) proof generation, and benchmarks the verifier against human-expert proof judgements on a set of target statements and generated proofs pairs.
Vincent Cohen-Addad, Dimitris Paparas, Ernest van Wijland et al.· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
