Las Vegas algorithms for linear and integer programming when the dimension is small (1995)
Cached
Download Links
- [www.cs.duke.edu]
- [www.almaden.ibm.com]
- [www.almaden.ibm.com]
- DBLP
Other Repositories/Bibliography
| Venue: | J. ACM |
| Citations: | 92 - 2 self |
BibTeX
@ARTICLE{Clarkson95lasvegas,
author = {Kenneth L. Clarkson},
title = {Las Vegas algorithms for linear and integer programming when the dimension is small},
journal = {J. ACM},
year = {1995},
volume = {42},
pages = {488--499}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper gives an algcmthm for solving linear programming problems. For a problem with tz constraints and d variables, the algorithm requires an expected O(d’n) + (log n)o(d)d’’+(’(’) + o(dJA log n) arithmetic operations, as rz ~ ~. The constant factors do not depend on d. Also, an algorlthm N gwen for integer hnear programmmg. Let p bound the number of bits required to specify the ratmnal numbers defmmg an input constraint or the ob~ective function vector. Let n and d be as before. Then, the algorithm requires expected 0(2d dn + S~dm In n) + dc)’d) ~ in H operations on numbers with O(1~p bits d ~ ~ ~z + ~, where the constant factors do not depend on d or p. The expectations are with respect to the random choices made by the algorithms, and the bounds hold for any gwen input. The techmque can be extended to other convex programming problems. For example, m algorlthm for finding the smallest sphere enclosing a set of /z points m Ed has the same t]me bound
