65 citations · 253 across the 47 of their papers we have counts for
45 papers · 1 filter
Polynomial Matrices in Integer Programming With Restricted Subdeterminants
Marcel Celaya, Stefan Kuhlmann, Robert Weismantel
We introduce a framework for tackling questions in discrete optimization associated with parametric constraint matrices. More precisely, the constraint matrices have entries that a…
A Threshold Number for the Shortest Vector Problem in the Infinity Norm
Stefan Kuhlmann, Robert Weismantel
For an integer full column rank matrix , we consider the lattice that consists of all integer combinations of columns of . We prove that a shortest non-zero vector has i…
Sparse Approximation in Lattices and Semigroups
Stefan Kuhlmann, Timm Oertel, Robert Weismantel
This paper deals with the following question: Suppose that there exist an integer or a non-negative integer solution to a system , where the number of non-zero componen…
Forall-exist statements in pseudopolynomial time
Eleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss +1
Given a convex set and an integer matrix , we consider statements of the form s.t. $Wx \leq…
On Matrices over a Polynomial Ring with Restricted Subdeterminants
Marcel Celaya, Stefan Kuhlmann, Robert Weismantel
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the rin…
Alternating Linear Minimization: Revisiting von Neumann's alternating projections
Gábor Braun, Sebastian Pokutta, Robert Weismantel
In 1933 von Neumann proved a beautiful result that one can approximate a point in the intersection of two convex sets by alternating projections, i.e., successively projecting on o…