• DOI:10.1145/201019.201036
Corpus ID: 6953625

Las Vegas algorithms for linear and integer programming when the dimension is small

@article{Clarkson1995LasVA,
  title={Las Vegas algorithms for linear and integer programming when the dimension is small},
  author={K. Clarkson},
  journal={J. ACM},
  year={1995},
  volume={42},
  pages={488-499}
}

K. Clarkson

Published 1995

Mathematics, Computer Science

J. ACM

This paper gives an algorithm for solving linear programming problems. For a problem with n constraints and d variables, the algorithm requires an expected<inline-equation><f>O<fen lp="par">d²n<rp post="par"></fen>+<fen lp="par">logn<rp post="par"></fen>O<fen lp="par">d<rp post="par"></fen>^{d/2+O<fen lp="par">1<rp post="par"></fen>}+O<fen lp="par">d⁴<rad><rcd>n</rcd></rad>logn<rp post="par"></fen></f></inline-equation> arithmetic operations, as<inline-equation><f… CONTINUE READING

View on ACM

cs.duke.edu

Save to Library

Create Alert

Cite

Launch Research Feed