Unique sink orientations of grids
type: Item
instance of: scholarly article
title: Unique sink orientations of grids
zbMATH Open document ID: 1203.68124
author: B. Gärtner
author: Walter Morris
author: Leo Rüst
published in: Algorithmica
publication date: 2008-07-01T00:00:00Z
full work available at URL: http://hdl.handle.net/20.500.11850/14390
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5294779
zbMATH Keywords: unique sink orientation
zbMATH Keywords: linear programming
zbMATH Keywords: generalized linear complementarity problem
zbMATH Keywords: sink finding algorithm
zbMATH Keywords: Holt-Klee condition
describes a project that uses: Miniball
describes a project that uses: OEIS
MaRDI profile type: Publication
OpenAlex ID: W2070970096
cites work: Long Monotone Paths in Abstract Polytopes
cites work: Q4418690
cites work: Mathematical Foundations of Computer Science 2004
cites work: Puzzles and polytope isomorphisms
cites work: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
cites work: Q3323698
cites work: Las Vegas algorithms for linear and integer programming when the dimension is small
cites work: Q4287357
cites work: A generalization of the linear complementarity problem
cites work: LP-orientations of cubes and crosspolytopes
cites work: Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem
cites work: Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem: Revisited
cites work: Q5687941
cites work: Grid orientations, \((d,d+2)\)-polytopes, and arrangements of pseudolines
cites work: THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
cites work: The Random‐Facet simplex algorithm on combinatorial cubes
cites work: Fundamentals of Computation Theory
cites work: Linear programming and unique sink orientations
cites work: Linear programming — Randomization and abstract frameworks
cites work: One line and n points
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Completely unimodal numberings of a simple polytope
cites work: A simple way to tell a simple polytope from its graph
cites work: Linear programming, the simplex algorithm and simple polytopes
cites work: A quasi-polynomial bound for the diameter\\of graphs of polyhedra
cites work: Polynomial algorithms in linear programming
cites work: Q4051879
cites work: Signable posets and partitionable simplicial complexes
cites work: A subexponential randomized algorithm for the simple stochastic game problem
cites work: Lower bounds for a subexponential optimization algorithm
cites work: A subexponential bound for linear programming
cites work: A Linear Complementarity Problem with a P-Matrix
cites work: Jumping Doesn’t Help in Abstract Cubes
cites work: Small-dimensional linear programming and convex hulls made easy
cites work: Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
cites work: Q3755482
cites work: Lectures on Polytopes
DOI: 10.1007/S00453-007-9090-X
description: scientific article; zbMATH DE number 5294779