3 papers
cs.MS2026
-server-bench: Automating Potential Discovery for the -Server Conjecture
Kirill Brilliantov, Etienne Bamas, Emmanuel Abbé
We introduce a code-based challenge for automated, open-ended mathematical discovery based on the -server conjecture, a central open problem in competitive analysis. The task is…
cs.DS2025
Randomized Rounding over Dynamic Programs
Etienne Bamas, Shi Li, Lars Rohwedder
We show that under mild assumptions for a problem whose solutions admit a dynamic programming-like recurrence relation, we can still find a solution under additional packing constr…
cs.DS2024
Lift-and-Project Integrality Gaps for Santa Claus
Etienne Bamas
This paper is devoted to the study of the MaxMinDegree Arborescence (MMDA) problem in layered directed graphs of depth , which is an important specia…