8 citations · 14 across the 4 of their papers we have counts for
4 papers
Clarksons Algorithm for Violator Spaces
Yves Brise, Bernd Gärtner
Clarksons algorithm is a two-staged randomized algorithm for solving linear programs. This algorithm has been simplified and adapted to fit the framework of LP-type problems. In th…
A Combinatorial Algorithm to Compute Regularization Paths
Bernd Gärtner, Joachim Giesen, Martin Jaggi +1
For a wide variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution…
Ranking Unit Squares with Few Visibilities
Bernd Gärtner
Given a set of n unit squares in the plane, the goal is to rank them in space in such a way that only few squares see each other vertically. We prove that ranking the squares accor…
Violator Spaces: Structure and Algorithms
Bernd Gärtner, Jirka Matousek, Leo Rüst +1
Sharir and Welzl introduced an abstract framework for optimization problems, called LP-type problems or also generalized linear programming problems, which proved useful in algorit…