Vaidya ( Linear Programming): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary Tag: Manual revert |
(3 intermediate revisions by the same user not shown) | |
(No difference)
|
Latest revision as of 09:41, 28 April 2023
Time Complexity
$O((m+n)$^{1.5}*n*L^{2} logL loglogL)
Space Complexity
$O((nm+n^{2})$L)? words
(can be easily derived?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1989
Reference
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/63499