13 citations · 19 across the 4 of their papers we have counts for
4 papers
A Strongly Polynomial Reduction for Linear Programs over Grids
Lorenz Klaus
We investigate the duality relation between linear programs over grids (Grid-LPs) and generalized linear complementarity problems (GLCPs) with hidden K-matrices. The two problems,…
Enumeration of PLCP-orientations of the 4-cube
Lorenz Klaus, Hiroyuki Miyata
The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is kno…
Counting Unique-Sink Orientations
Jan Foniok, Bernd Gärtner, Lorenz Klaus +1
Unique-sink orientations (USOs) are an abstract class of orientations of the n-cube graph. We consider some classes of USOs that are of interest in connection with the linear compl…
Combinatorial Characterizations of K-matrices
Jan Foniok, Komei Fukuda, Lorenz Klaus
We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Ptak on linear-algebraic characterizations of K-matrices to the setting…