The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height

Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli UpfalInf. Process. Lett 1995 · DOI

BibTeX
@article{broder1995worst,
  author = {Andrei Z. Broder and Martin E. Dyer and Alan M. Frieze and Prabhakar Raghavan and Eli Upfal},
  title = {{The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height}},
  journal = {Inf. Process. Lett.},
  year = {1995},
  doi = {10.1016/0020-0190(95)00101-h},
}

Loading related content...

Figure