Unique sink orientations of cubes

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 547-555

  Szabo T ^a   Welzl, E ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; OPTIMIZATION; RANDOM PROCESSES;

UNIQUE SINK ORIENTATIONS;

GRAPH THEORY;

EID: 0035186223     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959931     Document Type: Conference Paper

References (17)

1. A subexponential algorithm for abstract optimization problems
2. Combinatorial linear programming: Geometry can help
3. Randomized simplex algorithms on Klee-Minty cubes
4. Linear Programming - Randomization and abstract frameworks
5. Explicit and Implicit Enforcing - Randomized Optimization
6. Linear programming, the simplex algorithm and simple polytopes
7. Randomized principal pivot algorithms for P-matrix linear complementarity problems
8. Note on Bard-type scheme for solving the complementarity problem
9. Digraph models of Bard-type algorithms for the linear complementary problem
10. Completely unimodal numberings of a simple polytope