Recommendations
Cites work
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 4004228 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 1962853 (Why is no real title available?)
- scientific article; zbMATH DE number 960150 (Why is no real title available?)
- A Linear Complementarity Problem with a P-Matrix
- A generalization of the linear complementarity problem
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- A simple way to tell a simple polytope from its graph
- A subexponential bound for linear programming
- A subexponential randomized algorithm for the simple stochastic game problem
- Automata, logics, and infinite games. A guide to current research
- Completely unimodal numberings of a simple polytope
- Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
- Existence theory and Q-matrix characterization for the generalized linear complementarity problem
- Existence theory and Q-matrix characterization for the generalized linear complementarity problem: Revisited
- Fundamentals of Computation Theory
- Grid orientations, \((d,d+2)\)-polytopes, and arrangements of pseudolines
- Jumping Doesn’t Help in Abstract Cubes
- LP-orientations of cubes and crosspolytopes
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Lectures on Polytopes
- Linear programming and unique sink orientations
- Linear programming — Randomization and abstract frameworks
- Linear programming, the simplex algorithm and simple polytopes
- Long Monotone Paths in Abstract Polytopes
- Lower bounds for a subexponential optimization algorithm
- Mathematical Foundations of Computer Science 2004
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- One line and n points
- Polynomial algorithms in linear programming
- Puzzles and polytope isomorphisms
- Signable posets and partitionable simplicial complexes
- Small-dimensional linear programming and convex hulls made easy
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- The Random‐Facet simplex algorithm on combinatorial cubes
Cited in
(19)- The complexity of optimization on grids
- Realizability makes a difference: a complexity gap for sink-finding in USOs
- Finding the sink takes some time: An almost quadratic lower bound for finding the sink of unique sink oriented cubes
- Pivoting in linear complementarity: Two polynomial-time cases
- The complexity of all-switches strategy improvement
- Counting unique-sink orientations
- Realizability in Matoušek unique sink orientations: characterization and complexity gap
- A Mihalisin-Klee theorem for fans
- Random walks on polytopes of constant corank
- Enumeration of PLCP-orientations of the 4-cube
- Efficient computation of a canonical form for a matrix with the generalized P-property
- Unique Sink Orientations of Grids
- The complexity of recognizing unique sink orientations
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations
- Mathematical Foundations of Computer Science 2004
- On the Holt-Klee property for oriented matroid programming
- Directed random walks on polytopes with few facets
- Deterministic algorithms for unique sink orientations of grids
- Improved bound on the worst case complexity of policy iteration
This page was built for publication: Unique sink orientations of grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930596)
