Publications de Friedrich Eisenbrand

Integer Linear Programming for Unsupervised Training Set Selection in Molecular Machine Learning

Friedrich Eisenbrand, Rubén Laplaza Solanas, Anne-Clémence Corminboeuf, Ksenia Briling, Puck Elisabeth van Gerwen, Jan Weinreich

Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning (ML) applied to chemistry, we demonstrate the relev ...

IOP Publishing Ltd2025

Integer points in the degree-sequence polytope

Friedrich Eisenbrand, Rom Pinchasi

An integer vector 𝑏 ∈ Z𝑑 is a degree sequence if there exists a hypergraph with vertices {1, … , 𝑑} such that each 𝑏𝑖 is the number of hyperedges containing 𝑖. The degree-sequence polytope 𝒵 𝑑 is the convex hull of all degree sequences. We show that all bu ...

ELSEVIER2025

Forall-exist statements in pseudopolynomial time

Friedrich Eisenbrand

Given a convex set Q ⊆ R m and an integer matrix W ∈ Z m×n , we consider statements of the form ∀b ∈ Q ∩ Z m ∃x ∈ Z n s.t. W x ≤ b. Such statements can be verified in polynomial time with the algorithm of Kannan and its improvements if n is fixed and Q is ...

Society for Industrial and Applied Mathematics2025

From approximate to exact integer programming

Friedrich Eisenbrand

Approximate integer programming is the following: For a given convex body K subset of R-n, either determine whether K boolean AND Z(n) is empty, or find an integer point in the convex body 2 center dot (K - c)+ c which is K, scaled by 2 from its center of ...

Springer Heidelberg2024

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

Friedrich Eisenbrand, Lars Rohwedder

We consider the problem of finding a basis of a matroid with weight exactly equal to a given target. Here weights can be discrete values from

\{-\Delta,\ldots,\Delta\}

or more generally

m

-dimensional vectors of such discrete values. We resolve the para ...

IEEE2024

An Improved Bound on Sums of Square Roots via the Subspace Theorem

Friedrich Eisenbrand

The sum of square roots is as follows: Given x1, . . ., xn ∈ Z and a1, . . ., an ∈ N decide whether E = Pni=1 xi √ai ≥ 0. It is a prominent open problem (Problem 33 of the Open Problems Project), whether this can be decided in polynomial time. The state-of ...

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2024

Reducibility bounds of objective functions over the integers

Friedrich Eisenbrand, Kim-Manuel Klein

We study the settings where we are given a separable objective function of n variables defined in a given box of integers. We show that in many cases we can replace the given objective function by a new function with a much smaller domain. Our results appl ...

Elsevier2023

Metric learning for kernel ridge regression: assessment of molecular similarity

Friedrich Eisenbrand, Anne-Clémence Corminboeuf, Puck Elisabeth van Gerwen, Raimon Fabregat I De Aguilar-Amat

Supervised and unsupervised kernel-based algorithms widely used in the physical sciences depend upon the notion of similarity. Their reliance on pre-defined distance metrics-e.g. the Euclidean or Manhattan distance-are problematic especially when used in c ...

IOP Publishing Ltd2022

Approximate CVPp in time 2(0.802n)

Friedrich Eisenbrand, Moritz Andreas Venzin

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021