Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
Christoph Hunkenschröder, Martin Koutecký, Asaf Levin +1
We study the general integer programming (IP) problem of optimizing a separable convex function over the integer points of a polytope: $\min \{f(\mathbf{x}) \mid A\mathbf{x} = \mat…
cs.DS2022
Generalized -Center: Distinguishing Doubling and Highway Dimension
Andreas Emil Feldmann, Tung Anh Vu
We consider generalizations of the -Center problem in graphs of low doubling and highway dimension. For the Capacitated -Supplier with Outliers (CkSwO) problem, we show an ef…