no code implementations • 21 Dec 2020 • Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk, Moritz Venzin, Robert Weismantel
We give an algorithm that solves this problem in fixed-parameter time $f(d,\|A\|_{\infty})\cdot n\log^{O(2^d)} n$, where $f$ is a computable function and $n$ is the number of rows of $A$.
Data Structures and Algorithms Computational Complexity Optimization and Control
no code implementations • 5 Oct 2018 • Alberto Del Pia, Santanu S. Dey, Robert Weismantel
In subset selection we search for the best linear predictor that involves a small subset of variables.
1 code implementation • 3 Jul 2017 • Friedrich Eisenbrand, Robert Weismantel
This improves upon the longstanding best bound of Papadimitriou (1981) of $(m\cdot \Delta)^{O(m^2)}$, where in addition, the absolute values of the entries of $b$ also need to be bounded by $\Delta$.
Discrete Mathematics
