Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Berndt, Sebastian"'
Mixed-integer linear programming (MILP) is at the core of many advanced algorithms for solving fundamental problems in combinatorial optimization. The complexity of solving MILPs directly correlates with their support size, which is the minimum numbe
Externí odkaz:
http://arxiv.org/abs/2305.08432
The adoption of machine learning solutions is rapidly increasing across all parts of society. As the models grow larger, both training and inference of machine learning models is increasingly outsourced, e.g. to cloud service providers. This means th
Externí odkaz:
http://arxiv.org/abs/2302.06361
Publikováno v:
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, New York, NY, USA
Implementations of cryptographic libraries have been scrutinized for secret-dependent execution behavior exploitable by microarchitectural side-channel attacks. To prevent unintended leakages, most libraries moved to constant-time implementations of
Externí odkaz:
http://arxiv.org/abs/2108.04600
There is a long history of approximation schemes for the problem of scheduling jobs on identical machines to minimize the makespan. Such a scheme grants a $(1+\epsilon)$-approximation solution for every $\epsilon > 0$, but the running time grows expo
Externí odkaz:
http://arxiv.org/abs/2107.13638
Semi-online algorithms that are allowed to perform a bounded amount of repacking achieve guaranteed good worst-case behaviour in a more realistic setting. Most of the previous works focused on minimization problems that aim to minimize some costs. In
Externí odkaz:
http://arxiv.org/abs/2104.09803
We consider ILPs, where each variable corresponds to an integral point within a polytope $\mathcal{P}$, i. e., ILPs of the form $\min\{c^{\top}x\mid \sum_{p\in\mathcal P\cap \mathbb Z^d} x_p p = b, x\in\mathbb Z^{|\mathcal P\cap \mathbb Z^d|}_{\ge 0}
Externí odkaz:
http://arxiv.org/abs/2010.09255
Autor:
Bannach, Max, Berndt, Sebastian, Maack, Marten, Mnich, Matthias, Lassota, Alexandra, Rau, Malin, Skambath, Malte
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been studied extensively from the viewpoint of approximation algorithms, but
Externí odkaz:
http://arxiv.org/abs/2007.02660
The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices matching either
Externí odkaz:
http://arxiv.org/abs/2006.10847