F
Friedrich Eisenbrand
Researcher at École Polytechnique Fédérale de Lausanne
Publications - 128
Citations - 2845
Friedrich Eisenbrand is an academic researcher from École Polytechnique Fédérale de Lausanne. The author has contributed to research in topics: Integer programming & Approximation algorithm. The author has an hindex of 30, co-authored 125 publications receiving 2557 citations. Previous affiliations of Friedrich Eisenbrand include Saarland University & École Normale Supérieure.
Papers
More filters
Journal ArticleDOI
On the complexity of fixed parameter clique and dominating set
TL;DR: This work provides simple, faster algorithms for the detection of cliques and dominating sets of fixed order based on reductions to rectangular matrix multiplication and an improved algorithm for diamonds detection.
Journal ArticleDOI
Carathéodory bounds for integer cones
TL;DR: The analogues of Caratheodory's theorem for integer cones are provided and bounds to integer programming and to the cutting stock problem are applied.
Journal ArticleDOI
On the Membership Problem for the Elementary Closure of a Polyhedron
TL;DR: This result is achieved by an extension of a result by Caprara and Fischetti that, for some integral vector b and some rational vector , is NP-complete.
Proceedings ArticleDOI
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard
TL;DR: It is shown that the response time of a task cannot be approximated within any constant factor, unless P=NP, which means that response time computation for rate-monotonic, preemptive scheduling of periodic tasks is NP-hard under Turing reductions.
Posted Content
An Algorithmic Theory of Integer Programming
Friedrich Eisenbrand,Christoph Hunkenschröder,Kim-Manuel Klein,Martin Koutecký,Asaf Levin,Shmuel Onn +5 more
TL;DR: It is shown that integer programming can be solved in time, and a strongly-polynomial algorithm is derived, that is, with running time $g(a,d)\textrm{poly}(n)$, independent of the rest of the input data.