Counting unique-sink orientations

Authors:
Jan Foniok;Bernd Gärtner;Lorenz Klaus;Markus Sprecher
Affiliations:
-;-;-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 7
Cited 0

NP-completeness of the linear complementarity problem

Journal of Optimization Theory and Applications
Unique Sink Orientations of Cubes

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes

Discrete & Computational Geometry
Linear programming and unique sink orientations

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The Number Of Unique-Sink Orientations of the Hypercube*

Combinatorica
Unique Sink Orientations of Grids

Algorithmica
Pivoting in Linear Complementarity: Two Polynomial-Time Cases

Discrete & Computational Geometry - Special Issue Dedicated to the Memory of Victor Klee

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 complementarity problem. We summarize old and show new lower and upper bounds on the sizes of some such classes. Furthermore, we provide a characterization of K-matrices in terms of their corresponding USOs.