One line and n points

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 306-315

  Gartner B ^a   Tschirschnitz, F ^a   Solymosi, J ^a   Welzl, E ^a   Valtr, P ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING;

RANDOM EDGE SIMPLEX ALGORITHM;

RANDOM PROCESSES;

EID: 0034826180     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. The worst-case running time of the random simplex algorithm is exponential in the height
2. Randomized simplex algorithms on Klee-Minty cubes
3. A proof of the strict monotone 4-step conjecture
4. A subexponential randomized simplex algorithm
5. Some results on random linear programs
6. Completely unimodal numberings of a simple polytope